LeetCode 198

标签：

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 int rob(int[] nums) {
        if (nums.length == 0)
            return 0;

        if(nums.length == 1)
            return nums[0];
        
        int I_2 = nums[0];
        int I_1 = Math.max(nums[0], nums[1]);
        int temp;
        
        for (int i = 2; i < nums.length; i++) {
            temp = I_1;
            I_1 = Math.max(I_2 + nums[i], I_1);
            I_2 = temp;
        }
        
        return Math.max(I_1, I_2);
    }

LeetCode 198

标签：

原文地址：http://www.cnblogs.com/zhaihua/p/5551682.html