位1的个数
-
题目描述:
-
方法:
package NumberOfBits1; public class NumberOfBits101 { public static void main(String[] args) { System.out.println(hammingWeight(Integer.parseInt("00000000000000000000000000001011",2))); System.out.println(hammingWeight(Integer.parseInt("00000000000000000000000010000000",2))); } public static int hammingWeight(int n) { int sum = 0; while (n != 0) { sum++; n &= (n - 1); } return sum; } }