LeetCode - Medium - 198. House Robber

Topic

• Array
• Dynamic Programming

Description

link

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 systems connected and it will automatically contact the police if two adjacent houses were broken into on the same night.

Given an integer array nums representing the amount of money of each house, return the maximum amount of money you can rob tonight without alerting the police.

Example 1:

Input: nums = [1,2,3,1]
Output: 4
Explanation: Rob house 1 (money = 1) and then rob house 3 (money = 3).
Total amount you can rob = 1 + 3 = 4.

Example 2:

Input: nums = [2,7,9,3,1]
Output: 12
Explanation: Rob house 1 (money = 2), rob house 3 (money = 9) and rob house 5 (money = 1).
Total amount you can rob = 2 + 9 + 1 = 12.

Constraints:

• 1 <= nums.length <= 100
• 0 <= nums[i] <= 400

Analysis

动态规划

Carl教程

Submissions

public class HouseRobber {
    public int rob(int[] nums) {
        int[] dp = new int[nums.length];
        
        dp[0] = nums[0];
        
        if(nums.length > 1) 
        	dp[1] = Math.max(nums[0], nums[1]);
    	
        for(int i = 2; i < nums.length; i++) {
        	dp[i] = Math.max(nums[i] + dp[i - 2], dp[i - 1]);
        }
    	
    	return dp[nums.length - 1];
    }
}

Test

import static org.junit.Assert.*;
import org.junit.Test;

public class HouseRobberTest {

    @Test
    public void test() {
        HouseRobber hObj = new HouseRobber();
        
        assertEquals(1, hObj.rob(new int[] {1}));
        assertEquals(2, hObj.rob(new int[] {1, 2}));
        assertEquals(4, hObj.rob(new int[] {1, 2, 3, 1}));
        assertEquals(12, hObj.rob(new int[] {2, 7, 9 ,3, 1}));
    }
}