JAVA_Hamming Distance_LeetCode 461

JAVA_Hamming Distance_LeetCode 461 풀이 class Solution { public int hammingDistance(int x, int y) { return Integer.bitCount(x^y); } } * 출처 Hamming Distance - LeetCode Hamming Distance - 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 Exp... leetcode.com...

원문링크 : JAVA_Hamming Distance_LeetCode 461