g0401_0500.s0461_hamming_distance.Solution Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java21 Show documentation

Java-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.38

package g0401_0500.s0461_hamming_distance;

// #Easy #Bit_Manipulation #Udemy_Bit_Manipulation
// #2022_07_19_Time_0_ms_(100.00%)_Space_40.9_MB_(60.77%)

/**
 * 461 - Hamming Distance\.
 *
 * Easy
 *
 * The [Hamming distance](https://en.wikipedia.org/wiki/Hamming_distance) between two integers is the number of positions at which the corresponding bits are different.
 *
 * Given two integers `x` and `y`, return _the **Hamming distance** between them_.
 *
 * **Example 1:**
 *
 * **Input:** x = 1, y = 4
 *
 * **Output:** 2
 *
 * **Explanation:** 1 (0 0 0 1) 4 (0 1 0 0) ↑ ↑ The above arrows point to positions where the corresponding bits are different.
 *
 * **Example 2:**
 *
 * **Input:** x = 3, y = 1
 *
 * **Output:** 1
 *
 * **Constraints:**
 *
 * *   0 <= x, y <= 2³¹ - 1
**/
public class Solution {
    public int hammingDistance(int x, int y) {
        return Integer.bitCount(x ^ y);
    }
}