LeetCode--No.198--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.

思路：

首先肯定要有动规。
有nums[0..n]的最大值 = Max(nums[0..n-2]的最大值+ nums[n]， nums[0..n-1]的最大值)

1. 第一次尝试了递归，时间超时错误。
2. 解决递归问题。对于这种需要顺序扫描的数组问题，完全不需要使用递归。因为只需一个一个扫描下去数组元素，使用max来存储最大值即可。优化后的代码：

public class Solution {
    public int rob(int[] nums) {
        int length = nums.length;
        int max1 = 0;
        int max2 = 0;
        for(int i = 0; i < length; i++){
            int tmp = max2;
            max2 = Math.max(max1+nums[i], max2);
            max1 = tmp;
        }
        return Math.max(max1, max2);
    }
}

最开始也是设置了很多的判断条件，越看越丑，后来优化了一下，去掉很多没意义的判断。
算是第一个比较满意的代码吧。虽然都是Easy~~继续加油~~