@@ -0,0 +1,384 @@
+class Solution:%0A    # @param %7Binteger%5B%5D%7D nums%0A    # @return %7Binteger%7D%0A%0A    def rob(self, nums):%0A        if len(nums) == 1:%0A            return nums%5B0%5D%0A%0A        def rob_util(nums):%0A            res1 = res2 = 0%0A            for n in nums:%0A                res1, res2 = max(res1, res2), res1 + n%0A            return max(res1, res2)%0A        return max(rob_util(nums%5B1:%5D), rob_util(nums%5B:-1%5D))%0A

add solution for Hourse Robber II