Package g3201_3300.s3226_number_of_bit_changes_to_make_two_integers_equal

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    3226 - Number of Bit Changes to Make Two Integers Equal\.

    Easy

    You are given two positive integers n and k.

    You can choose any bit in the binary representation of n that is equal to 1 and change it to 0.

    Return the number of changes needed to make n equal to k. If it is impossible, return -1.

    Example 1:

    Input: n = 13, k = 4

    Output: 2

    Explanation: Initially, the binary representations of n and k are <code>n = (1101)<sub>2</sub></code> and <code>k = (0100)<sub>2</sub></code>. We can change the first and fourth bits of n. The resulting integer is <code>n = (<ins> 0 </ins>10<ins> 0 </ins>)<sub>2</sub> = k</code>.

    Example 2:

    Input: n = 21, k = 21

    Output: 0

    Explanation: n and k are already equal, so no changes are needed.

    Example 3:

    Input: n = 14, k = 13

    Output: \-1

    Explanation: It is not possible to make n equal to k.

    Constraints:

    • <code>1 <= n, k <= 10<sup>6</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer minChanges(Integer n, Integer k)

      • Methods inherited from class java.lang.Object

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