您的位置：首页 > 其它

LintCode Flip Bits

2015-09-13 22:46 357 查看

Determine the number of bits required to flip if you want to convert integer n to integer m.

Have you met this question in a real interview? Yes

Example

Given n = 31 (11111), m = 14 (01110), return 2.

Note

Both n and m are 32-bit integers.


class Solution {
public:
/**
*@param a, b: Two integer
*return: An integer
*/
int bitSwapRequired(int a, int b) {
// write your code here
int diff = a ^ b;
int count = 0;
while (diff) {
count++;
diff = diff & (diff - 1);
}
return count;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 点击这里给我发消息
标签： 
相关文章推荐
新的分享
章节导航