LeetCode题目:House Robber

House Robber:

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 system connected and it will automatically contact the police if two adjacent houses were broken into on the same night.

Given a list of non-negative integers representing the amount of money of each house, determine the maximum amount of money you can rob tonight without alerting the police.

tags:动态规划

class Solution {
public:
    int rob(vector<int>& nums) {
        //coll数组用来保存前i间house可以rob到的最大值
        vector<int> coll;
        int size = nums.size();
        if(0 == size)
            return 0;
        if(1 == size)
            return nums[0];
        //初始化条件
        coll.push_back(nums[0]);
        coll.push_back(nums[0] > nums[1] ? nums[0] : nums[1]);
        //前i间house可以rob到的最大值可以根据coll[i - 1]、coll[i - 2]、nums[i]构造出来
        for(int i = 2; i < size; ++i)
            coll.push_back(max(coll[i - 1], coll[i - 2] + nums[i]));
        return coll[size - 1];
    }
};