LeetCode Top Interview Questions 191. Number of 1 Bits (Java版; Easy)
题目描述
Write a function that takes an unsigned integer and return the number of '1' bits it has (also known as the Hamming weight).
Example 1:
Input: 00000000000000000000000000001011
Output: 3
Explanation: The input binary string 00000000000000000000000000001011 has a total of three '1' bits.
Example 2:
Input: 00000000000000000000000010000000
Output: 1
Explanation: The input binary string 00000000000000000000000010000000 has a total of one '1' bit.
Example 3:
Input: 11111111111111111111111111111101
Output: 31
Explanation: The input binary string 11111111111111111111111111111101 has a total of thirty one '1' bits.
Note:
Note that in some languages such as Java, there is no unsigned integer type. In this case, the input will be
given as signed integer type and should not affect your implementation, as the internal binary representation
of the integer is the same whether it is signed or unsigned.
In Java, the compiler represents the signed integers using 2's complement notation. Therefore, in Example
3 above the input represents the signed integer -3.
第一次做; 循环条件要注意考虑负数
/*
11111111111111111111111111111101
31
*/publicclassSolution{// you need to treat n as an unsigned valuepublicinthammingWeight(int n){int res =0;//细节: 不能使用n>0, 这样就没法判断负数的情况了while(n!=0){
res++;
n = n &(n-1);}return res;}}