[Leetcode] Number of 1 Bits

最新推荐文章于 2020-10-02 12:52:18 发布

原创最新推荐文章于 2020-10-02 12:52:18 发布 · 1k 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

Leetcode 专栏收录该内容

24 篇文章

订阅专栏

本文介绍了一个函数，用于计算给定无符号整数中1的位数，即该整数的Hamming权值。通过实例演示了如何使用此函数，并特别感谢了对问题和测试案例作出贡献的@ts。

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.

Credits:

Special thanks to @ts for adding this problem and creating all test cases.

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 & 1;
            n = n >>> 1;
        }
        return count;
    }
}