[LeetCode]461.Hamming Distance
来源:互联网 发布:北大青鸟crt软件下载 编辑:程序博客网 时间:2024/06/05 03:35
[LeetCode]461.Hamming Distance
题目描述
思路
按照题目要求,最简单的思路是求异或,然后数异或结果的二进制表示中1的个数
异或简单,具体是数1的过程
答案的方法是 n&(n - 1)
从右向左一次数1
比如:
xxxx10
减1后是
xxxx01
进行与操作之后是
xxxx00
最右面的1就消去了
循环计数直到n为0
代码
class Solution {public: int hammingDistance(int x, int y) { int i = 0, n = x ^ y; while(n) { ++i; n &= n - 1; } return i; }};
0 0
- LeetCode 461. Hamming Distance
- 【Leetcode】461. Hamming Distance
- LeetCode 461. Hamming Distance
- LeetCode - 461. Hamming Distance
- LeetCode-461. Hamming Distance
- 【LeetCode】 461. Hamming Distance
- Leetcode-461. Hamming Distance
- Leetcode 461. Hamming Distance
- LeetCode--461. Hamming Distance
- 461. Hamming Distance [LeetCode]
- [LeetCode]461. Hamming Distance
- leetcode 461. Hamming Distance
- Leetcode 461. Hamming Distance
- LeetCode 461. Hamming Distance
- 【LeetCode】461. Hamming Distance
- LeetCode-461. Hamming Distance
- LeetCode | 461. Hamming Distance
- [LeetCode]461.Hamming Distance
- Nginx rewrite(重读)
- Git基础命令
- 8.迭代器
- 面向对象编程之继承
- IO初步
- [LeetCode]461.Hamming Distance
- 最大子列和
- redis入门之旅
- hdu 1019Least Common Multiple(最大公约数)
- Codeforces Round #401 (Div. 2), problem: (B) Game of Credit Cards
- QTableWidget数据表格
- poj1741 树分治
- JS高级程序
- ZwQuerySystemInformation 用来枚举内核模块