代码拉取完成,页面将自动刷新
package com.fishercoder.solutions;
/**
* 191. 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).
* For example, the 32-bit integer ’11' has binary representation 00000000000000000000000000001011, so the function should return 3.*/
public class _191 {
public static class Solution1 {
/**Doing bitwise AND operation between n and n-1 will always flip the least significant 1 bit in n to zero
example run for the above editorial solution: input 5, n will be 5&4 and becomes 4,
then in the next run, n will become 4&3 which is 0, thus exit the while loop.*/
public int hammingWeight(int n) {
int bits = 0;
while (n != 0) {
bits++;
n &= (n - 1);
}
return bits;
}
}
public static class Solution2 {
public int hammingWeight(int n) {
int bits = 0;
int mask = 1;
for (int i = 0; i < 32; i++) {
if ((n & mask) != 0) {
bits++;
}
mask <<= 1;
}
return bits;
}
}
public static class Solution3 {
public int hammingWeight(int n) {
int bits = 0;
for (int i = 0; i < 32; i++) {
if ((n & 1) == 1) {
bits++;
}
if (n == 0) {
return bits;
}
/**must use unsigned right shift operator since the problem says this is an unsigned value*/
n >>>= 1;
}
return bits;
}
}
public static class Solution4 {
public int hammingWeight(int n) {
int bits = 0;
for (int i = 0; i < 32; i++) {
bits += n & 1;
n >>>= 1;
}
return bits;
}
}
}
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。