LeetCode 198. 打家劫舍

class Solution {
public:
    int rob(vector<int>& nums) {
        int n = nums.size();
        vector<int> f(n + 1), g(n + 1);
        for(int i = 1; i <= n; i ++) {//等于n
            f[i] = g[i - 1] + nums[i - 1];//不要让nums[i]出界
            g[i] = max(g[i - 1], f[i - 1]);
        }
        return max(f[n], g[n]);
    }
};