LeetCode: Hamming Distance

 1 public class Solution {
 2     public int hammingDistance(int x, int y) {
 3         int ans = 0;
 4         while (x > 0 || y > 0) {
 5             ans += (x % 2) ^ (y % 2);
 6             x /= 2;
 7             y /= 2;
 8         }
 9         return ans;
10     }
11 }

posted @ 2017-02-23 15:50 ying_vincent 阅读(113) 评论(0) 收藏举报

刷新页面返回顶部