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.

题目大意：你是一个强盗。要抢劫一条街上的房屋，，但是相邻两间不可以都抢劫，否则会触发警报，给出每个房屋拥有的金钱，求所能偷的最大的金钱数。

方法：使用动态规划。

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

leetcode:House Robber

标签：

原文地址：http://www.cnblogs.com/zongmeng/p/4457963.html