Hamming Distance
来源:互联网 发布:linux wget https 404 编辑:程序博客网 时间:2024/04/30 19:40
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.
点击打开链接
int hammingDistance(int x, int y) { int res = 0; for(int i = 0; i < 31; i++){ if((x&(1<<i))^(y&(1<<i)))res++; } return res;}
0 0
- Hamming Distance
- hamming distance
- hamming distance
- Hamming Distance
- Hamming Distance
- Hamming Distance
- Hamming Distance
- Hamming Distance
- Hamming Distance
- Hamming Distance
- Hamming distance
- Hamming Distance
- Hamming Distance
- hamming distance
- hamming distance
- Hamming Distance
- Hamming Distance
- Hamming Distance
- RandomAccessFile小节
- Web 前端学习笔记之 HTML 入门(2)
- Android学习之activity用法举例
- Pynlpir词性标记集
- 三分钟看懂一致性哈希算法
- Hamming Distance
- 复杂HTML代码深度解析
- golang编译arm平台程序
- Leetcode 159. Longest Substring with At Most Two Distinct Characters (Hard) (cpp)
- Ajax中的eval函数的用法
- oracle 修改默认日期格式
- Web 前端学习笔记之 HTML 入门(3)
- 2016.12.29回顾
- 东周列国 演绎版 mp3