191 位1的个数

  1. public class Solution {
  2. // you need to treat n as an unsigned value
  3. public int hammingWeight(int n) {
  4. int count = 0;
  5. while (n != 0) {
  6. count += (n & 1);
  7. // 利用java语言中的无符号右移(>>>)
  8. n = n >>> 1;
  9. }
  10. return count;
  11. }
  12. }