动态规划 一维 198. House Robber (Easy)

You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security systems connected and it will automatically contact the police if two adjacent houses were broken into on the same night.
Given an integer array nums representing the amount of money of each house, return the maximum amount of money you can rob tonight without alerting the police.
Example 1:
Input: nums = [1,2,3,1]
Output: 4
Explanation: Rob house 1 (money = 1) and then rob house 3 (money = 3).
Total amount you can rob = 1 + 3 = 4.
Example 2:
Input: nums = [2,7,9,3,1]
Output: 12
Explanation: Rob house 1 (money = 2), rob house 3 (money = 9) and rob house 5 (money = 1).
Total amount you can rob = 2 + 9 + 1 = 12.
Constraints:
1 <= nums.length <= 100
0 <= nums[i] <= 400

class Solution {
public:
    int rob(vector<int>& nums) {
        if(nums.size() == 1) return nums[0];
        int dp[nums.size()];
        vector<bool> visited(nums.size(),false);
        dp[0] = nums[0];
        visited[0] = true;
        if(nums[1] > dp[0]){
            dp[1] = nums[1];
            visited[1] = true;
        }
        else{
            dp[1] = dp[0];
        }
        for(int i = 2; i < nums.size(); i++){
            if(!visited[i-1]){
                dp[i] = dp[i-1] + nums[i];
                visited[i] = true;
            }//其实这里没必要写一个visited，如果i-1没被偷，说明dpi-1就等于dpi-2,dp[i-2] + nums[i] > dp[i-1]一定成立
            else{
                if(dp[i-2] + nums[i] > dp[i-1]){
                //这里我觉得应该写>而不是>=，就是当偷这家与不偷这家钱相等时选择不偷这家，这样假设这家是倒数第二家，还有一家就可以再偷了
                //但其实，这写>和>=是完全等价的，假设我们写了>=，偷了这家，然后最后一家如果应该偷，也就是dpi-2 + numsi > dp[i-1]时，此时会变成dpi-2+numsi，也就是没偷这家，相当于这家还是没偷也就是这家是dp[i-1]
                    dp[i] = dp[i-2] + nums[i];
                    visited[i] = true;
                }
                else{
                    dp[i] = dp[i-1];
                }
            }
        }
        return dp[nums.size()-1];
    }
};

简化版

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