[Leo] 4th Week solutions (fixed number-of-1-bits Time Complexity to O(k)

Author: leokim0922

number-of-1-bits/Leo.py

@@ -8,7 +8,7 @@ def hammingWeight(self, n: int) -> int:
 
         return counter
 
-        ## TC: O(n), SC: O(1)
+        ## TC: O(k), SC: O(1), since given int(n) has constant length
 
         # counter = 0