Check if a number has bits in alternate pattern | Set 1

Given an integer n > 0, the task is to find whether this integer has an alternate pattern in its bits representation. For example- 5 has an alternate pattern i.e. 101.
Print “Yes” if it has an alternate pattern otherwise “No”. Here alternate pattern can be like 0101 or 1010.

Examples:

Input :  15
Output :  No
Explanation: Binary representation of 15 is 1111.

Input :  10
Output :  Yes
Explanation: Binary representation of 10 is 1010.



A simple approach is to find its binary equivalent and then check its bits.

C++

filter_none

edit
close

play_arrow

link
brightness_4
code

// C++ program to find if a number has alternate
// bit pattern
#include<bits/stdc++.h>
using namespace std;
  
// Returns true if n has alternate bit pattern
// else false
bool findPattern(int n)
{
    // Store last bit
    int prev = n % 2;
    n = n/2;
  
    // Traverse through remaining bits
    while (n > 0)
    {
        int curr = n % 2;
  
        // If current bit is same as previous
        if (curr == prev)
           return false;
  
        prev = curr;
        n = n / 2;
    }
  
    return true;
}
  
// Driver code
int main()
{
    int n = 10;
    if (findPattern(n))
        cout << "Yes";
    else
        cout << "No";
  
    return 0;
}

chevron_right


Java

filter_none

edit
close

play_arrow

link
brightness_4
code

// Java program to find if a number has alternate
// bit pattern
  
class Test
{
    // Returns true if n has alternate bit pattern
    // else false
    static boolean findPattern(int n)
    {
        // Store last bit
        int prev = n % 2;
        n = n/2;
       
        // Traverse through remaining bits
        while (n > 0)
        {
            int curr = n % 2;
       
            // If current bit is same as previous
            if (curr == prev)
               return false;
       
            prev = curr;
            n = n / 2;
        }
       
        return true;
    }
      
    // Driver method
    public static void main(String args[])
    {
        int n = 10;
        System.out.println(findPattern(n) ? "Yes" : "No");
       
    }
}

chevron_right


Python3

filter_none

edit
close

play_arrow

link
brightness_4
code

# Python3 program to find if a number 
# has alternate bit pattern
  
# Returns true if n has alternate 
# bit pattern else false
def findPattern(n):
  
    # Store last bit
    prev = n % 2
    n = n // 2
  
    # Traverse through remaining bits
    while (n > 0):
      
        curr = n % 2
  
        # If current bit is same as previous
        if (curr == prev):
            return False
  
        prev = curr
        n = n // 2
      
    return True
  
# Driver code
n = 10
print("Yes") if(findPattern(n)) else print("No")
  
# This code is contributed by Anant Agarwal.

chevron_right


C#

filter_none

edit
close

play_arrow

link
brightness_4
code

// Program to find if a number
// has alternate bit pattern
using System;
  
class Test {
  
    // Returns true if n has alternate
    // bit pattern else returns false
    static bool findPattern(int n)
    {
        // Store last bit
        int prev = n % 2;
        n = n / 2;
  
        // Traverse through remaining bits
        while (n > 0) {
            int curr = n % 2;
  
            // If current bit is same as previous
            if (curr == prev)
                return false;
  
            prev = curr;
            n = n / 2;
        }
  
        return true;
    }
  
    // Driver method
    public static void Main()
    {
        int n = 10;
        Console.WriteLine(findPattern(n) ? "Yes" : "No");
    }
}
  
// This code is contributed by Anant Agarwal.

chevron_right


PHP

filter_none

edit
close

play_arrow

link
brightness_4
code

<?php
// PHP program to find if a 
// number has alternate
// bit pattern
  
// Returns true if n has 
// alternate bit pattern
// else false
function findPattern($n)
{
      
    // Store last bit
    $prev = $n % 2;
    $n = $n / 2;
  
    // Traverse through 
    // remaining bits
    while ($n > 0)
    {
        $curr = $n % 2;
  
        // If current bit is 
        // same as previous
        if ($curr == $prev)
        return false;
  
        $prev = $curr;
        $n = floor($n / 2);
    }
  
    return true;
}
  
    // Driver code
    $n = 10;
    if (findPattern($n))
        echo "Yes";
    else
        echo "No";
          
    return 0;
  
// This code is contributed by nitin mittal. 
?>

chevron_right



Output:

Yes

Reference:
http://stackoverflow.com/questions/38690278/program-to-check-whether-the-given-integer-has-an-alternate-pattern

This article is contributed by Sahil Chhabra (akku). If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.



My Personal Notes arrow_drop_up

Improved By : nitin mittal



Article Tags :
Practice Tags :


Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.