LeetCode-Solutions-in-Cpp17

Solutions to high-frequency interview questions of LeetCode in C++17, taking into account both efficiency and comprehensibility.

---

Project maintained by downdemo Hosted on GitHub Pages — Theme by mattgraham

• 计算异或结果的二进制表示中的 1 的个数即可，计算方法参考 #191

class Solution {
 public:
  int hammingDistance(int x, int y) {
    int t = x ^ y;
    int res = 0;
    while (t) {
      ++res;
      t &= t - 1;  // 将最低位的 1 改为 0
    }
    return res;
  }
};