LeetCode之461. Hamming Distance
2016-12-31 22:37
417 查看
------------------------------------------------------------------
AC代码:
public class Solution { public int hammingDistance(int x, int y) { return Integer.toString(x^y,2).replaceAll("0","").length(); } }
题目来源: https://leetcode.com/problems/hamming-distance/
相关文章推荐
- LeetCode--461. Hamming Distance(汉明距离)Python
- 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 python实现
- 【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
- leetcode_461. Hamming Distance 计算汉明距离,按位异或运算,计算整数的二进制表示中1的个数 java