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.

应用动态规划的思想：全局最优则有局部最优。

假设偷到第n个房子时的最大收益为maxSum［n］。

则此时有两种方式：

一，偷第n家，第n－1家就不能偷，同时必须保证前n－2家偷取的方式为最优（保证最大收益），才能保证全局最优。

二，不偷第n家，则必须保证前n－1家偷取的方式为最优，才能保证全局是最优的。

综上，可得递推公式：maxSum[i] = max(maxSum[i - 2] + nums[i], maxSum[i - 1])

int max(int a, int b){
	if(a > b)
		return a;
	else
		return b;
}

int rob(int* nums, int numsSize) {
	int maxSum[numsSize];
	maxSum[0] = nums[0];
	maxSum[1] = max(nums[0] , nums[1]);
	int i;
	for(i = 2; i < numsSize; i++){
		maxSum[i] = max(maxSum[i - 2] + nums[i], maxSum[i - 1]);
	}
	return maxSum[numsSize - 1];
}