(leetcode)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.

使用动态规划的做法：

设置一个数组maxv[n]记录，当到达第i个时候，最大值是多少

 1 class Solution {
 2 public:
 3     int rob(vector<int>& nums) {
 4         int n = nums.size();
 5         if(nums.size() == 0) return 0;
 6         if(nums.size() == 1) return nums[0];
 7         int maxv[n];
 8         maxv[0] = nums[0];
 9         maxv[1] = max(nums[0],nums[1]);
10         
11         for(int i = 2;i < nums.size();++i)
12         {
13             maxv[i] = max(maxv[i-2]+nums[i],maxv[i-1]);
14         }
15         return maxv[n-1];
16     }
17 };

(leetcode)House Robber

标签：

原文地址：http://www.cnblogs.com/chdxiaoming/p/4714084.html