Most elegant way to change 0 to 1 and vice versa

by

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

More Related Contents:

  1. Fast algorithm to calculate n! / (q!)^r
  2. How to make fibonacci method? [closed]
  3. is there an algorithm to reverse a chosen part of a number? [closed]
  4. Deciding a Big-O notation for an algorithm
  5. What is the fastest search algorithm for a list with names and numbers
  6. Generating all permutations of a given string
  7. Finding the max/min value in an array of primitives using Java
  8. Which Java Collection should I use?
  9. Effective gif/image color quantization?
  10. Natural sort order string comparison in Java – is one built in? [duplicate]
  11. Java lambdas 20 times slower than anonymous classes
  12. Connect 4 check for a win algorithm
  13. How to calculate elapsed time from now with Joda-Time?
  14. Picking a random element from a set
  15. Prime numbers by Eratosthenes quicker sequential than concurrently?
  16. What would be the fastest method to test for primality in Java?
  17. Java – Removing duplicates in an ArrayList
  18. Fast algorithm for searching for substrings in a string
  19. Parallel execution of directed acyclic graph of tasks
  20. How to generate a random permutation in Java?
  21. What is a good solution for calculating an average where the sum of all values exceeds a double’s limits?
  22. Intersection of two strings in Java
  23. In Java, how do I efficiently and elegantly stream a tree node’s descendants?
  24. Flatten nested arrays in java
  25. Generate Random Numbers in Array [duplicate]
  26. How to determine if binary tree is balanced?
  27. Algorithm – How to delete duplicate elements in a list efficiently?
  28. Determine the most common occurrence in an array
  29. Hash : How does it work internally?
  30. What is the algorithm for finding the center of a circle from three points?

Leave a Comment