Invert actual bits of a number

Given a non-negative integer n. The problem is to invert the bits of n and print the number obtained after inverting the bits. Note that the actual binary representation of the number is being considered for inverting the bits, no leading 0’s are being considered.
Examples :

Input : 11
Output : 4
(11)10 = (1011)[2]
After inverting the bits, we get:
(0100)2 = (4)10.

Input : 10
Output : 5
(10)10 = (1010)2.
After reversing the bits we get:
(0101)2 = (101)2
        = (5)10.

Method 1 (Using bitwise operators)

Prerequisite : Toggling k-th bit of a number

C++



filter_none

edit
close

play_arrow

link
brightness_4
code

// CPP program to invert actual bits
// of a number.
#include <bits/stdc++.h>
using namespace std;
  
void invertBits(int num)
{
    // calculating number of bits
    // in the number
    int x = log2(num) + 1;
  
    // Inverting the bits one by one
    for (int i = 0; i < x; i++) 
       num = (num ^ (1 << i)); 
   
    cout << num;
}
  
// Driver code
int main()
{
    int num = 11; 
    invertBits(num);
    return 0;
}

chevron_right


Java

filter_none

edit
close

play_arrow

link
brightness_4
code

// Java program to invert 
// actual bits of a number.
import java.io.*;
  
class GFG
{
    static void invertBits(int num)
    {
        // calculating number of 
        // bits in the number
        int x = (int)(Math.log(num) / 
                      Math.log(2)) + 1;
      
        // Inverting the 
        // bits one by one
        for (int i = 0; i < x; i++) 
        num = (num ^ (1 << i)); 
      
        System.out.println(num);
    }
      
    // Driver code
    public static void main (String[] args) 
    {
        int num = 11
        invertBits(num);
    }
  
}
  
// This code is contributed
// by Anuj_67

chevron_right


Python3

filter_none

edit
close

play_arrow

link
brightness_4
code

# Python3 program to invert actual 
# bits of a number. 
import math
  
def invertBits(num): 
  
    # calculating number of bits 
    # in the number 
    x = int(math.log2(num)) + 1
  
    # Inverting the bits one by one 
    for i in range(x): 
        num = (num ^ (1 << i)) 
      
    print(num) 
  
# Driver Code
num = 11
invertBits(num) 
  
# This code is contributed 
# by Rituraj Jain

chevron_right


C#

filter_none

edit
close

play_arrow

link
brightness_4
code

// C# program to invert 
// actual bits of a number.
using System;
  
class GFG
{
    static void invertBits(int num)
    {
        // calculating number of 
        // bits in the number
        int x = (int)(Math.Log(num) / 
                       Math.Log(2)) + 1;
      
        // Inverting the 
        // bits one by one
        for (int i = 0; i < x; i++) 
        num = (num ^ (1 << i)); 
      
        Console.WriteLine(num);
    }
      
    // Driver code
    public static void Main () 
    {
        int num = 11; 
        invertBits(num);
    }
  
}
  
// This code is contributed
// by Anuj_67

chevron_right


PHP

filter_none

edit
close

play_arrow

link
brightness_4
code

<?php
// PHP program to invert actual bits
// of a number.
  
function invertBits( $num)
{
      
    // calculating number of bits
    // in the number
    $x = log($num) + 1;
  
    // Inverting the bits one by one
    for($i = 0; $i < $x; $i++) 
    $num = ($num ^ (1 << $i)); 
  
    echo $num;
}
  
    // Driver code
    $num = 11; 
    invertBits($num);
      
// This code is contributed by anuj_67.
?>

chevron_right


Output:

4

Time complexity : O(log n)
Auxiliary space : O(1)

Method 2 (Using Bitset)
Here we use the flip() of bitset to invert the bits of the number, in order to avoid flipping the leading zeroes in the binary representation of number, we have calculated the number of bits in the binary representation, and flipped only the actual bits of number.We have used to_ulong() to convert bitset to number.

C++

filter_none

edit
close

play_arrow

link
brightness_4
code

// CPP program to invert actual bits
// of a number.
#include <bits/stdc++.h>
using namespace std;
  
void invertBits(int num)
{
    // calculating number of bits
    // in the number
    int x = log2(num) + 1;
  
    // Considering number to be 32 bit integer;
    bitset<32> b(num);
  
    // reversing the bits one by one
    for (int i = 0; i < x; i++) 
        b.flip(i);
  
    // converting bitset to number
    cout << b.to_ulong(); 
}
  
// Driver code
int main()
{
    int num = 11; 
    invertBits(num);
    return 0;
}

chevron_right


Java

filter_none

edit
close

play_arrow

link
brightness_4
code

// Java program to invert actual 
// bits of a number.
class GFG 
{
    static void invertBits(int num)
    {
        // calculating number of 
        // bits in the number
        int x = (int)(Math.log(num) / 
                      Math.log(2)) + 1;
      
        // Inverting the bits
        // one by one
          
        for (int i = 0; i < x; i++) 
        num = (num ^ (1 << i)); 
      
        System.out.print(num);
    }
      
    // Driver code
    public static void main(String[] args)
    {
        int num = 11
        invertBits(num);
    }
}
  
// This code is contributed by Mukul Singh

chevron_right


Python 3

filter_none

edit
close

play_arrow

link
brightness_4
code

# Python 3 program to invert actual 
# bits of a number.
import math
  
def invertBits(num):
      
    # calculating number of 
    # bits in the number
    x = int(math.log(num, 2.0) + 1);
  
    # Inverting the bits
    # one by one
    for i in range(0, x): 
        num = (num ^ (1 << i)); 
  
    print(num);
  
# Driver code
num = 11
invertBits(num);
  
# This code is contributed 
# by Akanksha Rai

chevron_right


C#

filter_none

edit
close

play_arrow

link
brightness_4
code

// C# program to invert actual 
// bits of a number.
using System;
  
class GFG 
{
    static void invertBits(int num)
    {
        // calculating number of 
        // bits in the number
        int x = (int)Math.Log(num, 2) + 1;
      
        // Inverting the bits
        // one by one
        for (int i = 0; i < x; i++) 
        num = (num ^ (1 << i)); 
      
        Console.Write(num);
    }
      
    // Driver code
    static void Main()
    {
        int num = 11; 
        invertBits(num);
    }
  
}
  
// This code is contributed by Anuj_67

chevron_right


PHP

filter_none

edit
close

play_arrow

link
brightness_4
code

<?php
// PHP program to invert actual 
// bits of a number. 
function invertBits($num
    // calculating number of 
    // bits in the number 
    $x = log($num) + 1; 
  
    // Inverting the bits 
    // one by one 
    for ($i = 0; $i < $x; $i++) 
    $num = ($num ^ (1 << $i)); 
  
        echo $num
  
// Driver code 
$num = 11; 
invertBits($num); 
  
// This code is contributed 
// by ajit
?>

chevron_right


Output :

4

Time complexity: O(log n)
Auxiliary space: O(1)



My Personal Notes arrow_drop_up

Check out this Author's contributed articles.

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 Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.





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.