Flip bits done

Author: rampatra

src/main/java/com/ctci/bitmanipulation/Conversion.java

@@ -0,0 +1,40 @@
+package com.ctci.bitmanipulation;
+
+/**
+ * @author rampatra
+ * @since 2019-03-17
+ */
+public class Conversion {
+
+    /**
+     * Write a function to determine the number of bits you would need to flip to convert
+     * integer A to integer B.
+     * Example:
+     * Input: 29 (or: 11101), 15 (or: 01111)
+     * Output: 2
+     * 
+     * @param a
+     * @param b
+     * @return the number of bits to flip
+     */
+    private static int getNoOfBitsToFlipToConvertAToB(int a, int b) {
+        return countSetBits(a ^ b);
+    }
+
+    private static int countSetBits(int n) {
+        int count = 0;
+        while (n > 0) {
+            if ((n & 1) == 1) {
+                count++;
+            }
+            n >>>= 1;
+        }
+        return count;
+    }
+
+    public static void main(String[] args) {
+        System.out.println(getNoOfBitsToFlipToConvertAToB(5, 7));
+        System.out.println(getNoOfBitsToFlipToConvertAToB(5, 5));
+        System.out.println(getNoOfBitsToFlipToConvertAToB(29, 15));
+    }
+}

src/main/java/com/ctci/bitmanipulation/FlipBitToWin.java

@@ -10,7 +10,8 @@ public class FlipBitToWin {
      * You have an integer and you can flip exactly one bit from a O to a 1. Write code to find the length of the
      * longest sequence of 1s you could create.
      * Example:
-     * Input: 1775 (or: 11011101111) Output: 8
+     * Input: 1775 (or: 11011101111)
+     * Output: 8
      * <p>
      * Approach:
      * We just walk through the integer tracking the current 1s sequence length and the previous 1s sequence length.