标签：
2015.4.17 05:52
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.
Solution:
This is a simple dynamic programming problem, which can be solved either in-place or using O(1) extra space.
Please see the code below.
Accepted code:
1 // 1WA, 1AC, O(1) space. 2 #include <algorithm> 3 using namespace std; 4 5 class Solution { 6 public: 7 int rob(vector<int> &num) { 8 int n = num.size(); 9 int i; 10 11 if (n == 0) { 12 return 0; 13 } else if (n == 1) { 14 return num[0]; 15 } else if (n == 2) { 16 return max(num[0], num[1]); 17 } 18 19 int ans; 20 21 ans = max(num[0], num[1]); 22 num[2] = num[0] + num[2]; 23 ans = max(ans, num[2]); 24 for (i = 3; i < n; ++i) { 25 num[i] = max(num[i - 2], num[i - 3]) + num[i]; 26 ans = max(ans, num[i]); 27 } 28 29 return ans; 30 } 31 };
标签：
原文地址：http://www.cnblogs.com/zhuli19901106/p/4433856.html
