150125

Author: aluferraz

leetcode/editor/en/Q2429/MinimizeXor.py

@@ -0,0 +1,25 @@
+# leetcode submit region begin(Prohibit modification and deletion)
+class Solution:
+    def minimizeXor(self, num1: int, num2: int) -> int:
+        tot = bin(num2).count('1')
+        num1 = f"{num1:032b}"
+        ans = list(num1)
+        free = []
+        for i in range(32):
+            if tot == 0:
+                ans[i] = '0'
+                free.append(i)
+            elif ans[i] == '1':
+                tot -= 1
+            else:
+                free.append(i)
+        for i in range(tot):
+            ans[free.pop()] = '1'
+        return int("".join(ans), 2)
+
+
+# leetcode submit region end(Prohibit modification and deletion)
+
+
+class MinimizeXor(Solution):
+    pass

main.py

@@ -1,4 +1,4 @@
-from leetcode.editor.en.Q3223.MinimumLengthOfStringAfterOperations import MinimumLengthOfStringAfterOperations
+from leetcode.editor.en.Q2429.MinimizeXor import MinimizeXor
 
 if __name__ == '__main__':
-    print(MinimumLengthOfStringAfterOperations().minimumLength("abaacbcbb"))
+    print(MinimizeXor().minimizeXor(2, 5))