Package g2401_2500.s2429_minimize_xor

Class Solution

java.lang.Object

g2401_2500.s2429_minimize_xor.Solution

public class Solution
extends Object

2429 - Minimize XOR.<p>Medium</p> <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>&rsquo;s in its binary representation.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> num1 = 3, num2 = 5</p> <p><strong>Output:</strong> 3</p> <p><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.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> num1 = 1, num2 = 12</p> <p><strong>Output:</strong> 3</p> <p><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.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= num1, num2 <= 10⁹</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	minimizeXor(int num1, int num2)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

minimizeXor

public int minimizeXor(int num1,
 int num2)