leetcode_171 problem--number of 1 bits (bitwise operations)

Number of 1 BitsTotal accepted:38248 Total submissions:101730my submissions QuestionSolution

Write a function that takes an unsigned integer and returns the number of ' 1 ' bits it has (also known as the Hamming weigh T).

For example, the 32-bit integer ' One ' 00000000000000000000000000001011 has a binary representation, so the function should return 3.

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

Hide TagsBit ManipulationHide Similar Problems(e) Reverse Bits (e) Power ofHas you met this question in a real interview? Yes No

Discuss

#include <iostream>using namespace std; #define uint32_t unsigned intint hammingweight (uint32_t n) {int Re=0;while ( N) {re++;n=n& (n-1);} return re;} int main () {}

　　

leetcode_171 problem--number of 1 bits (bitwise operations)