Number of 1 Bits
LeetCode https://leetcode.cn/problems/number-of-1-bits/
1
2
3
4
5
6
7
8
9
10
11
12
class Solution {
public int hammingWeight(int n) {
int res = 0;
while (n != 0) {
res++;
n &= n - 1;
}
return res;
}
}
Complexity
- Time = O(k),k 为 n 的二进制长度
- Space = O(1)
This post is licensed under CC BY 4.0 by the author.