Update find-unique-binary-string.py

Author: kamyu104

Python/find-unique-binary-string.py

@@ -20,7 +20,7 @@ def findDifferentBinaryString(self, nums):
         :rtype: str
         """
         lookup = set(map(lambda x: int(x, 2), nums))  # Time: O(k * n) = O(n^2)
-        return next(bin(i)[2:].zfill(len(nums[0])) for i in xrange(2**len(nums[0])) if i not in lookup)  # Time: O(k) = O(n)
+        return next(bin(i)[2:].zfill(len(nums[0])) for i in xrange(2**len(nums[0])) if i not in lookup)  # Time: O(k + n) = O(n)
 
 
 # Time:  O(k * n + n * 2^n) = O(n * 2^n), k is len(nums)
@@ -32,5 +32,5 @@ def findAllDifferentBinaryStrings(self, nums):
         :type nums: List[str]
         :rtype: List[str]
         """
-        lookup = set(map(lambda x: int(x, 2), nums))  # Time: O(k * n + n * 2^n) = O(n * 2^n)
+        lookup = set(map(lambda x: int(x, 2), nums))  # Time: O(k * n) = O(n * 2^n)
         return [bin(i)[2:].zfill(len(nums[0])) for i in xrange(2**len(nums[0])) if i not in lookup]  # Time: O(2^n + n * (2^n - k))