What is the most elegant way to do the next stuff:
int i = oneOrZero;
if (i == 0) {
i = 1;
} else {
i = 0;
}
You can assume that i
can have only 1 or 0 value.
What is the most elegant way to do the next stuff:
int i = oneOrZero;
if (i == 0) {
i = 1;
} else {
i = 0;
}
You can assume that i
can have only 1 or 0 value.
i ^= 1;
XOR the value with 1. This gives you both ways (in case you need to flip 0 <--> 1
either way):
0 ^ 1 = 1
1 ^ 1 = 0
i = (i == 0)?1:0
is one way, though I like @Jimmy's and @Yuval's versions better.
i = ( i + 1 ) % 2
, though I think we all agree the subtraction or xor method is better! (Though it has the added benefit of "flipping the switch" for more than binary.)