Leetcode 198. 打家劫舍 动态规划

原题链接：Leetcode 198. 打家劫舍

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