HouseRobber（即求一串数中不连续的数之和中最大的）

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.

Solutions：

1）

应用动态规划思想，r[i]=max { r[i-1], r[i-2]+num[i] }

错误做法：

class Solution {
public:	
	int max(int a, int b) {
		return a>b?a:b;
	}
    int rob(vector<int>& nums) {
		int maxsum=0;
		if(nums.empty()){
			return maxsum;
		}
		if(nums.size()==1) {
			return nums[0];
		}
		if(nums.size() == 2) {
			return max(nums[0], nums[1]);
		}
		vector<int> r;
		r.push_back(nums[0]);
		r.push_back(nums[1]);
		for(int i=2; i< nums.size(); ++i) {
			int m=0;
			m=max(r[i-1], r[i-2]+nums[i]);
			r.push_back(m);
		}
		return r.back();
    }
};

对于[2,1,1,2]会得到3，应为4. 错误在于对r[1]的处理。

 class Solution {
public:	
	int max(int a, int b) {
		return a>b?a:b;
	}
    int rob(vector<int>& nums) {
		int maxsum=0;
		if(nums.empty()){
			return maxsum;
		}		
		vector<int> r;
		r.push_back(nums[0]);		
		for(int i=1; i< nums.size(); ++i) {
			int m=0;
			if(i == 1) {
				m=max(nums[0], nums[1]);
			}
			else {
				m=max(r[i-1], r[i-2]+nums[i]);
			}			
			r.push_back(m);
		}
		return r.back();
    }
};

2）还可以分别记录到偶数和奇数位时的最值。

class Solution {
public:
	int rob(vector<int> &nums) {
		int odd=0, even=0；
		if(nums.size()==0) {
			return 0;
		}
		even = nums[0];
		for(int i=1; i<nums.size(); ++i) {
			if(i & 0x1) {
				odd=max(even, odd+nums[i]);
			}
			else {
				even=max(odd, even+nums[i]);
			}
		}
		return max(even, odd);
	}	
};

3）也是动态规划。和上边的算法基本一致。

      用A[0]表示没有rob当前house的最大money，A[1]表示rob了当前house的最大money，那么A[0] 等于rob或者没有rob上一次house的最大值。即A[i+1][0] = max(A[i][0], A[i][1])..  那么rob当前的house，只能等于上次没有rob的+money[i+1], 则A[i+1][1] = A[i][0]+money[i+1]。

只需要两个变量保存结果就可以了。

class Solution {
public:
    int rob(vector<int> &num) {
        int best0 = 0;   // 表示没有选择当前house
        int best1 = 0;   // 表示选择了当前house
        for(int i = 0; i < num.size(); i++){
            int temp = best0;
            best0 = max(best0, best1); // 没有选择当前house，那么它等于上次选择了或没选择的最大值
            best1 = temp + num[i]; // 选择了当前house，值只能等于上次没选择的+当前house的money
        }
        return max(best0, best1);
    }
};