首页 > 代码库 > leetcode 191
leetcode 191
191. Number of 1 Bits
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.
求出输入整数的32位中有多少位值为1.
代码如下：
1 class Solution { 2 public: 3 int hammingWeight(uint32_t n) { 4 unsigned pos = 1 << 31; 5 int count = 0; 6 while(pos) 7 { 8 if(pos & n) 9 {10 count++;11 }12 pos >>= 1;13 }14 return count;15 }16 };
leetcode 191
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。