Total Accepted: 32005 Total Submissions: 45111 Difficulty: Easy Contributors: Samuri 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.
Note: 0 ≤ x, y < 231.
Example:
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.
class Solution {public: int hammingDistance(int x, int y) { vector<int>result; int dst = x^y; while(dst) { if(dst%2==1) { result.push_back(dst%2); } dst/=2; } return result.size(); }};新聞熱點
疑難解答
