美文网首页
191. Number of 1 Bits

191. Number of 1 Bits

作者: juexin | 来源:发表于2017-01-09 19:30 被阅读0次

    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.

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

    相关文章

      网友评论

          本文标题:191. Number of 1 Bits

          本文链接:https://www.haomeiwen.com/subject/bqmhbttx.html