The Hamming distance between two integers is the number of positions at which the corresponding bits are different.
Given two integers x and y, calculate the Hamming distance.
Example:
Input: x = 1, y = 4Output: 2Explanation:1 (0 0 0 1)4 (0 1 0 0) ↑ ↑The above arrows point to positions where the corresponding bits are different.class Solution {public: int hammingDistance(int x, int y) { int cnt = 0; while(x || y){ if((x & 1) != (y & 1)) ++cnt; x >>= 1; y >>= 1; } return cnt; }};先異或，再轉(zhuǎn)換成有多少個(gè)1
class Solution {public: int hammingDistance(int x, int y) { int dist = 0, n = x ^ y; while (n) { ++dist; n &= n - 1; } return dist; }};新聞熱點(diǎn)
疑難解答
圖片精選
網(wǎng)友關(guān)注
