[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.

Credits:
Special thanks to @ifanchu for adding this problem and creating all test cases. Also thanks to @ts for adding additional test cases.

动态规划。状态转移方程为：dp[i] = max(dp[i-1], dp[i-2] + num[i])

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

 还是动规，分别维护到奇数下标时和到偶数下标时的最大和。

 1 class Solution {
 2 public:
 3     int rob(vector<int> &num) {
 4         int odd = 0, even = 0;
 5         for (int i = 0; i < num.size(); ++i) {
 6             if (i & 0x1) odd = max(odd + num[i], even);
 7             else even = max(even + num[i], odd);
 8         }
 9         return max(odd, even);
10     }
11 };

 

转载于:https://www.cnblogs.com/easonliu/p/4384008.html