Update minimum-one-bit-operations-to-make-integers-zero.py

Author: kamyu104

Python/minimum-one-bit-operations-to-make-integers-zero.py

@@ -36,8 +36,9 @@ def minimumOneBitOperations(self, n):
         #
         # [observation2]:
         # let pos be an array of positions where the bit is 1 in ascending order:
-        # f(1XX...X) = f(100...0) - f(XX...X)
-        #            = (2^(pos[k-1]+1)-1) - f(XX...X)
+	    # f(0XX...X) + f(1XX...X) = f(100...0)
+        # f(1XX...X) = f(100...0) - f(0XX...X)
+        #            = (2^(pos[k-1]+1)-1) - f(0XX...X)
         # by mathematical induction
         # => f(n) = (2^(pos[k-1]+1)-1) - (2^(pos[k-2])+1) + ... + (-1)^(k-1) * (2^(pos[0]+1)-1)
         result = 0