Write a function that takes an unsigned integer and returns the number of ’1' bits it has (also known as the Hamming weight).
For example, the 32-bit integer ’11' has binary representation 00000000000000000000000000001011, so the function should return 3.
class Solution {
public:
int hammingWeight(uint32_t n) {
int r = 0;
for(int i=0;i<32;i++){
if(n & 0x01 == 1) r+=1;
n = n >> 1;
}
return r;
}
};
题目来自leetcode 191. Number of 1 Bits 题目 Write a function th...
191. Number of 1 Bits 题目: https://leetcode.com/problems/n...
Problem Write a function that takes an unsigned integer a...
Java
Write a function that takes an unsigned integer and retur...
Swift 3.0
1.描述 Write a function that takes an unsigned integer and ...
Write a function that takes an unsigned integer and retur...
Write a function that takes an unsigned integer and retur...
https://leetcode-cn.com/problems/number-of-1-bits/ （图片来源h...
本文标题：191. Number of 1 Bits
本文链接：https://www.haomeiwen.com/subject/gzupettx.html
网友评论