no message

Author: wuduhren

problems/binary-watch.py

@@ -0,0 +1,14 @@
+"""
+Time: O(1)
+Space: O(1), no "extra" space are used.
+"""
+class Solution(object):
+    def readBinaryWatch(self, turnedOn):
+        ans = []
+        if turnedOn>8: return ans #at most 8 LED are turned on for a valid time.
+
+        for h in xrange(12):
+            for m in xrange(60):
+                if (bin(h) + bin(m)).count('1')==turnedOn:
+                    ans.append('%d:%02d' % (h, m))
+        return ans

problems/queue-reconstruction-by-height.py

@@ -0,0 +1,15 @@
+"""
+Time: O(N^2)
+Space: O(N)
+
+People need to be exactly insert to index k, so that there are "exact" k people equal or taller to k.
+Shorter person does not matter (invisible) to taller person, so insert taller person first.
+People does not care about the people on their right, so insert the person with smaller k first.
+"""
+class Solution(object):
+    def reconstructQueue(self, people):
+        people.sort(key=lambda x: (-x[0], x[1]))
+        ans = []
+        for h, k in people:
+            ans.insert(k, (h, k))
+        return ans