Solve : meeting rooms ii

Author: printjin-gmailcom

binary-tree-level-order-traversal/printjin-gmailcom.py

@@ -0,0 +1,13 @@
+class Solution:
+    def levelOrder(self, root):
+        result = []
+        def dfs(node, level):
+            if not node:
+                return
+            if len(result) == level:
+                result.append([])
+            result[level].append(node.val)
+            dfs(node.left, level + 1)
+            dfs(node.right, level + 1)
+        dfs(root, 0)
+        return result

house-robber-ii/printjin-gmailcom.py

@@ -0,0 +1,10 @@
+class Solution:
+    def rob(self, nums):
+        if len(nums) == 1:
+            return nums[0]
+        def rob_linear(houses):
+            prev = curr = 0
+            for num in houses:
+                prev, curr = curr, max(curr, prev + num)
+            return curr
+        return max(rob_linear(nums[:-1]), rob_linear(nums[1:]))

meeting-rooms-ii/printjin-gmailcom.py

@@ -0,0 +1,14 @@
+class Solution:
+    def minMeetingRooms(self, intervals):
+        if not intervals:
+            return 0
+        starts = sorted(i[0] for i in intervals)
+        ends = sorted(i[1] for i in intervals)
+        s = e = rooms = 0
+        while s < len(intervals):
+            if starts[s] < ends[e]:
+                rooms += 1
+            else:
+                e += 1
+            s += 1
+        return rooms