solves #2220: Minimum Bit Flips to Convert Number in java

Author: anishLearnsToCode

Diff for: README.md

@@ -722,7 +722,7 @@
 | 2206 | [Divide Array Into Equal Pairs](https://leetcode.com/problems/divide-array-into-equal-pairs)                                                                           |                                                                                  [![Java](assets/java.png)](src/DivideArrayIntoEqualPairs.java)                                                                                  |                                                                                                                                   |
 | 2210 | [Count Hills and Valleys in an Array](https://leetcode.com/problems/count-hills-and-valleys-in-an-array)                                                               |                                                                                [![Java](assets/java.png)](src/CountHillsAndValleysInAnArray.java)                                                                                |                                                                                                                                   |
 | 2215 | [Find the Difference of Two Arrays](https://leetcode.com/problems/find-the-difference-of-two-arrays)                                                                   |                                                                                [![Java](assets/java.png)](src/FindTheDifferenceOfTwoArrays.java)                                                                                 |                                                                                                                                   |
-| 2220 | [Minimum Bit Flips to Convert Number](https://leetcode.com/problems/minimum-bit-flips-to-convert-number)                                                               |                                                                                                                                                                                                                                  |                                                                                                                                   |
+| 2220 | [Minimum Bit Flips to Convert Number](https://leetcode.com/problems/minimum-bit-flips-to-convert-number)                                                               |                                                                               [![Java](assets/java.png)](src/MinimumBitFlipsToConvertNumber.java)                                                                                |                                                                                                                                   |
 | 2224 | [Minimum Number of Operations to Convert Time](https://leetcode.com/problems/minimum-number-of-operations-to-convert-time)                                             |                                                                                                                                                                                                                                  |                                                                                                                                   |
 | 2229 | 🔒 [Check if an array is consecutive](https://leetcode.com/problems/check-if-an-array-is-consecutive)                                                                  |                                                                                                                                                                                                                                  |                                                                                                                                   |
 | 2231 | [Largest Number After Digit Swaps by Parity](https://leetcode.com/problems/largest-number-after-digit-swaps-by-parity)                                                 |                                                                                                                                                                                                                                  |                                                                                                                                   |

Diff for: src/MinimumBitFlipsToConvertNumber.java

@@ -0,0 +1,18 @@
+// https://leetcode.com/problems/minimum-bit-flips-to-convert-number
+// T: O(log(n))
+// S: O(1)
+
+public class MinimumBitFlipsToConvertNumber {
+    public int minBitFlips(int start, int goal) {
+        return hammingWeight(start ^ goal);
+    }
+
+    private int hammingWeight(int x) {
+        int result = 0;
+        while (x > 0) {
+            x = x & (x - 1);
+            result++;
+        }
+        return result;
+    }
+}