Bit Counting Codewars

Write a function that takes an integer as input, and returns the number of bits that are equal to one in the binary representation of that number. You can guarantee that input is non-negative.

Example: The binary representation of 1234 is 10011010010, so the function should return 5 in this case

Code(Java)

public static int countBits(int n)

     {

         int count=0;

         String BinaryValues=Integer.toBinaryString(n);

         //System.out.println(BinaryValues);

         for(int i=0;i<BinaryValues.length();i++)

         {

              if(BinaryValues.charAt(i)=='1')

              {

                  count++;

              }

         }

         return count;

     }

Solution 2:

public static int countBits(int n){



    return Integer.bitCount(n);

  }

More at : https://onlylang.blogspot.com/