Create houe-robber.py

uses dynamic programming to find optimal solution

Author: gabedonnan

houe-robber.py

@@ -0,0 +1,13 @@
+class Solution(object):
+    def rob(self, nums):
+        """
+        :type nums: List[int]
+        :rtype: int
+        """
+        l = 0
+        r = 0
+        for num in nums:
+            temp = l
+            l = max(num + r,l)
+            r = temp
+        return l