[LeetCode 198] House Robber

题目链接：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.
 *
 */

public class HouseRobber {

//	69 / 69 test cases passed.
//	Status: Accepted
//	Runtime: 185 ms
//	Submitted: 0 minutes ago
	
	//时间复杂度O(n)，空间复杂度O(1)
    
	public static int rob(int[] num) {
        int len =num.length;
        if(len == 0)	return 0;
        if(len == 1)	return num[0]; 
	    if(num[1] < num[0])		num[1] = num[0];
	    for (int i = 2; i < num.length; i++) 
	        num[i] = Math.max(num[i - 2] + num[i], num[i - 1]);
	    return num[len - 1];
    }
}

[LeetCode 198] House Robber

原文：http://blog.csdn.net/ever223/article/details/45050877