# [LeetCode] Number of 1 Bits

Source: Internet
Author: User

[LeetCode] Number of 1 Bits

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 shocould return 3.

Solution 1

Each bitwise AND 1 are performed and calculated separately. The statistical result is not a zero-digit number.

Implementation Code 1
``````//Runtime:10 ms#include

#include "inttypes.h"using namespace std;class Solution {public:    int hammingWeight(uint32_t n) {        int i = 0;        while (n)        {            i += n & 0x1;            n >>= 1;        }        return i;    }};int main(){    Solution s;    cout<

``````
`Solution 2Each n & (n-1) operation can reduce the number of digits with the value of 1 in n by one.Implementation Code 2//Runtime:11 msclass Solution {public: int hammingWeight(uint32_t n) { int i = 0; while (n) { n &= (n-1); ++i; } return i; }};`
Related Keywords:
Related Article

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

## A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

• #### Sales Support

1 on 1 presale consultation

• #### After-Sales Support

24/7 Technical Support 6 Free Tickets per Quarter Faster Response

• Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.