<p>Given two positive integers <code>num1</code> and <code>num2</code>, find the positive integer <code>x</code> such that:</p>

<ul>
	<li><code>x</code> has the same number of set bits as <code>num2</code>, and</li>
	<li>The value <code>x XOR num1</code> is <strong>minimal</strong>.</li>
</ul>

<p>Note that <code>XOR</code> is the bitwise XOR operation.</p>

<p>Return <em>the integer </em><code>x</code>. The test cases are generated such that <code>x</code> is <strong>uniquely determined</strong>.</p>

<p>The number of <strong>set bits</strong> of an integer is the number of <code>1</code>&#39;s in its binary representation.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> num1 = 3, num2 = 5
<strong>Output:</strong> 3
<strong>Explanation:</strong>
The binary representations of num1 and num2 are 0011 and 0101, respectively.
The integer <strong>3</strong> has the same number of set bits as num2, and the value <code>3 XOR 3 = 0</code> is minimal.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> num1 = 1, num2 = 12
<strong>Output:</strong> 3
<strong>Explanation:</strong>
The binary representations of num1 and num2 are 0001 and 1100, respectively.
The integer <strong>3</strong> has the same number of set bits as num2, and the value <code>3 XOR 1 = 2</code> is minimal.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= num1, num2 &lt;= 10<sup>9</sup></code></li>
</ul>

class Solution:
    def get_binary_sums(seld,num):
        p=1
        a=[]
        b=set()
        while p*2<=num:
            p*=2
        while p>0:
            if p<=num:
                a.append(p)
                b.add(p)
                num-=p
            p//=2
        return a,b

    def minimizeXor(self, num1: int, num2: int) -> int:
        num1_b_nums,num1_b_set=self.get_binary_sums(num1)
        num2_b_nums,num2_b_set=self.get_binary_sums(num2)
        if len(num1_b_nums) == len(num2_b_nums):
            return num1
        if len(num1_b_nums) > len(num2_b_nums):
            c=0
            for i in range(len(num2_b_nums)):
                c+=num1_b_nums[i]
            return c
        num=num1
        p=1
        for i in range(len(num2_b_nums)-len(num1_b_nums)):
            while p in num1_b_set:
                p*=2
            num+=p
            p*=2
        return num
        
39