leetcode_191 title--number of 1 Bits (Sinotrans)

Number of 1 BitsTotal accepted:25965 Total submissions:70075my 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 ManipulationHas you met this question in a real interview? Yes No

Discuss

This problem considers the bitwise and the operation and the left shift of the bits to the right.

#include <iostream> #include <bitset>typedef unsigned int uint32_t;using namespace Std;int hammingweight ( uint32_t n) {unsigned int temp=1;int result=0;for (int i=0;i<32;i++) {int temp2=temp<<i;if ((N&TEMP2)!=0) Result+=1;} return result;} int main () {cout<
　　
leetcode_191 title--number of 1 Bits (Sinotrans)