Length of the Longest Consecutive 1s in Binary Representation - GeeksforGeeks

Length of the Longest Consecutive 1s in Binary Representation - GeeksforGeeks
Given a number n, find length of the longest consecutive 1s in its binary representation.

Naive Approach: One simple way would be to simply loop over the bits, and keep track of the number of consecutive set bits, and the maximum that this value has reached. In this approach, we need to convert it to binary (base-2) representation and then find and print the result.

Using Bit Magic: The idea is based on the concept that if we AND a bit sequence with a shifted version of itself, we’re effectively removing the trailing 1 from every sequence of consecutive 1s.

      11101111   (x)
    & 11011110   (x << 1)
    ----------
      11001110   (x & (x << 1)) 
        ^    ^
        |    |
   trailing 1 removed

So the operation x = (x & (x << 1)) reduces length of every sequence of 1s by one in binary representation of x. If we keep doing this operation in a loop, we end up with x = 0. The number of iterations required to reach 0 is actually length of the longest consecutive sequence of 1s.

    private static int maxConsecutiveOnes(int x)

    {

        // Initialize result

        int count = 0;

 

        // Count the number of iterations to

        // reach x = 0.

        while (x!=0)

        {

            // This operation reduces length

            // of every sequence of 1s by one.

            x = (x & (x << 1));

 

            count++;

        }

 

        return count;

    }

if we want Length of the Longest Consecutive 0s in Binary Representation what we have to do
Read full article from Length of the Longest Consecutive 1s in Binary Representation - GeeksforGeeks