Given a int suppose 5, whose binary representation is 101, we need to flip the bit which will be 010, which will be 2

Question

I am converting the given int to binary represention which is string, and then traversing the string and changing each char/bit in string and then converting back to required int.

Myquestion is, is there a mathematical or better way to do this?

You should look at bitwise operators in Java – ilmirons Jan 10 '18 at 09:55 — ilmirons, Jan 10 '18 at 09:55

score 0 · Answer 1 · answered Jan 10 '18 at 09:55

0

Using the bitwise operator ~ (not) you can do it without iteration. Example method:

public static int flipBits(int n) {
    return ~n;
}

You can also do it without a method, but for a general use using a method may be easier.

answered Jan 10 '18 at 09:55

Zoe

27,060
21
118
148

2

Careful as that flips non significant bits as well (0s on the left of original number), might not be the result asker is looking for. – Oday Mansour Jan 10 '18 at 10:00
2

And... what about the sign bit, and all the other bits between the sign bit and the very first '1' bit? – zlakad Jan 10 '18 at 10:00
this gives me -6 as answer but required is 2 – codeZach Jan 10 '18 at 10:06

score 0 · Answer 2 · answered Jan 10 '18 at 09:58

0

Okay I got one more solution in which we find the maximum number that can be formed by digit's length bit, i.e for 5 `101' we can get 111 which is 7, so we subtract 7-5(given number) = 2, required solution

answered Jan 10 '18 at 09:58

codeZach

39
5

Given a int suppose 5, whose binary representation is 101, we need to flip the bit which will be 010, which will be 2

2 Answers2