leetcode 198 House Robber（难易度：Easy）

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.

代码：

#define max(a,b) (((a) > (b)) ? (a) : (b))

int rob(int* nums, int numsSize) {
    if (nums == NULL || numsSize <= 0)
		return 0;

	int best0 = 0;	// 表示没有选择当前house
	int best1 = 0;	// 表示选择了当前house
	for (int i = 0; i < numsSize; i++) {
		int temp = best0;
		best0 = max(best1, best0);<span><span class="comment">  // 没有选择当前house，那么它等于上次选择了或没选择的最大值</span><span></span></span>
		best1 = temp + nums[i];  <span> <span class="comment">// 选择了当前house，值只能等于上次没选择的+当前house的money</span><span></span></span>
	}
	return max(best0, best1);

}

原题地址： https://leetcode.com/problems/house-robber/