【LeetCode191】Number of 1 Bits★

1.题目

2.思路

方法一：常规方法。

方法二：给面试官惊喜的解法。

3.java代码

方法一代码：

 public class Solution {
     // you need to treat n as an unsigned value
     public int hammingWeight(int n) {
         int count=0;
     int flag=1;
     while(flag!=0){
         if((n&flag)!=0)
             count++;
         flag=flag<<1;
         }
     return count;
     }
 }

方法二代码：

 public class Solution {
     // you need to treat n as an unsigned value
     public int hammingWeight(int n) {
         int count=0;
         while(n!=0){
             count++;
             n=n&(n-1);
         }
         return count;
     }
 }