[LeetCode] 198. House Robber

思路：DP，dp[i]表示到第i个房子的最大值。

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