【LeetCode】191. Number of 1 Bits 位1的个数(Easy)(JAVA)
题目地址: https://leetcode.com/problems/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).
Note:
- Note that in some languages such as Java, there is no unsigned integer type. In this case, the input will be given as a signed integer type. It should not affect your implementation, as the integer’s internal binary representation 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.
Follow up: If this function is called many times, how would you optimize it?
Example 1:
Input: n = 00000000000000000000000000001011
Output: 3
Explanation: The input binary string 00000000000000000000000000001011 has a total of three '1' bits.
Example 2:
Input: n = 00000000000000000000000010000000
Output: 1
Explanation: The input binary string 00000000000000000000000010000000 has a total of one '1' bit.
Example 3:
Input: n = 11111111111111111111111111111101
Output: 31
Explanation: The input binary string 11111111111111111111111111111101 has a total of thirty one '1' bits.
Constraints:
- The input must be a binary string of length 32
题目大意
编写一个函数,输入是一个无符号整数(以二进制串的形式),返回其二进制表达式中数字位数为 ‘1’ 的个数(也被称为汉明重量)。
提示:
- 请注意,在某些语言(如 Java)中,没有无符号整数类型。在这种情况下,输入和输出都将被指定为有符号整数类型,并且不应影响您的实现,因为无论整数是有符号的还是无符号的,其内部的二进制表示形式都是相同的。
- 在 Java 中,编译器使用二进制补码记法来表示有符号整数。因此,在上面的 示例 3 中,输入表示有符号整数 -3。
进阶:
- 如果多次调用这个函数,你将如何优化你的算法?
解题方法
暴力查找
- 把 n 转为二进制数,然后数出 1 的个数
- 时间复杂度 O(n)
public class Solution {
// you need to treat n as an unsigned value
public int hammingWeight(int n) {
String binaryString = Integer.toBinaryString(n);
int res = 0;
for (int i = 0; i < binaryString.length(); i++) {
if (binaryString.charAt(i) == '1') res++;
}
return res;
}
}
执行耗时:2 ms,击败了7.95% 的Java用户
内存消耗:35.4 MB,击败了79.61% 的Java用户
优化
- 当 n 不为 0 的时候,把最高位(也就是第一个不是 0 的 1)变为 0: n &= n - 1
- 不断循环,时间复杂度为: O(k), k 为 1 的个数
public class Solution {
// you need to treat n as an unsigned value
public int hammingWeight(int n) {
int res = 0;
while (n != 0) {
res++;
n &= n - 1;
}
return res;
}
}
执行耗时:0 ms,击败了100.00% 的Java用户
内存消耗:35.4 MB,击败了75.83% 的Java用户
![](https://img-blog.csdnimg.cn/20201107174624800.jpg?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzE2OTI3ODUz,size_16,color_FFFFFF,t_70#pic_center)