C++實現LeetCode(191.位1的個數)

Posted on by

[LeetCode] 191.Number of 1 Bits 位1的個數

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.

很簡單的一道位操作Bit Manipulation的題，最近新出的三道題都沒有啥難度啊，這樣會誤導新人的，做瞭這三道得出個LeetCode沒啥難度的結論，其實裡面好題真的不少，難題也很多，經典題也多，反正就是贊贊贊，32個贊。

class Solution {
public:
    int hammingWeight(uint32_t n) {
        int res = 0;
        for (int i = 0; i < 32; ++i) {
            res += (n & 1);
            n = n >> 1;
        }
        return res;
    }
};

到此這篇關於C++實現LeetCode(191.位1的個數)的文章就介紹到這瞭,更多相關C++實現位1的個數內容請搜索WalkonNet以前的文章或繼續瀏覽下面的相關文章希望大傢以後多多支持WalkonNet！

推薦閱讀：