At each house, decide whether including it (plus the best total up to two houses back) beats skipping it (keeping the best total from the previous house).

House Robber

medium

Acceptance: 48%

Dynamic Programming

Given a row of houses each containing a certain amount of valuables, determine the maximum total value you can collect without selecting two adjacent houses. The values are provided as an integer array.

Examples

Example 1:

Input:nums = [3,5,1,8]

Output:13

Explanation: Choosing house 2 (value 5) and house 4 (value 8) yields 5 + 8 = 13.

Example 2:

Input:nums = [4,1,2,7,5]

Output:11

Explanation: Choosing houses 1, 3, and 5 gives 4 + 2 + 5 = 11.

Hints

1234567

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Write your solution here
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Write your solution here
    }
}

House Robber

Examples

Hints

Related Problems