198.House Robber cpp version (0ms)

Author: zouwx2cs

solution/198.House Robber/Solution.cpp

@@ -0,0 +1,20 @@
+class Solution {
+public:
+    int rob(vector<int>& nums) {
+        if (nums.size() == 0)
+            return 0 ;
+        if (nums.size() == 1)
+            return nums[0] ;
+        vector<int> dp(nums.size(), -1) ;
+        dp[0] = nums[0] ;
+        dp[1] = max(nums[0], nums[1]) ;
+        for (int i = 2; i < nums.size(); ++i)
+        {
+            dp[i] = max(
+                dp[i-2] + nums[i],
+                dp[i-1]
+            ) ;
+        }
+        return dp[dp.size()-1] ;
+    }
+};