/*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 Numberof1Bits { public static void main(String[] args) { // TODO Auto-generated method stub System.out.println(hammingWeight(11)); } public static int hammingWeight(int n) { String str = Integer.toBinaryString(n); char[] ch = str.toCharArray(); int count = 0; for (int i = 0; i < ch.length; i++) { if (ch[i] == 49) count++; } return count; } }