> For the complete documentation index, see [llms.txt](https://wentao-shao.gitbook.io/leetcode/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://wentao-shao.gitbook.io/leetcode/dynamic-programming/1.position/198.house-robber.md).

# 198.House-Robber

## 198. House Robber

## 题目地址

<https://leetcode.com/problems/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.

Example 1:
Input: [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: [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.
```

## 代码

### Approach #1 Recursive (top-down)

```java
class Solution {
  public int rob(int[] nums) {
    return rob(nums, nums.length - 1);
  }

  private int rob(int[] nums, int i) {
    if (i < 0)    return 0;
    return Math.max(rob(nums, i - 2) + nums[i],
                   rob(nums, i - 1));
  }
}
```

### Approach #2 Recursive + memo (top-down)

```java
class Solution {
  public int rob(int[] nums) {
    int[] memo = new int[nums.length + 1];
    Arrays.fill(memo, -1);
    return rob(nums, nums.length - 1, memo);
  }

  private int rob(int[] nums, int i, int[] memo) {
    if (i < 0)    return 0;
    if (memo[i] >= 0) return memo[i];

    int result = Math.max(rob(nums, i - 2) + nums[i],
                         rob(nums, i - 1));
    memo[i] = result;
    return result;
  }
}
```

### Approach #3 Iterative + memo (bottom-up)

`dp[i + 1] = Math.max(dp[i], dp[i - 1] + val)`

```java
class Solution {
  public int rob(int[] nums) {
    if (nums.length == 0)        return 0;
    int[] dp = new int[nums.length + 1];
    dp[0] = 0;
    dp[1] = nums[0];

    for (int i = 1; i < nums.length; i++) {
      int val = nums[i];
      dp[i + 1] = Math.max(dp[i], dp[i - 1] + val);
    }

    return dp[nums.length];
  }
}
```

### Approach #4 Iterative + 2 variable (bottom-up)

```java
class Solution {
  public int rob(int[] nums) {
        int prevMax = 0;
    int currMax = 0;
    for (int num: nums) {
      int temp = currMax;
      currMax = Math.max(prevMax + num, currMax);
      prevMax = temp
    }
    return currMax;
  }
}
```


---

# Agent Instructions
This documentation is published with GitBook. GitBook is the documentation platform designed so that both humans and AI agents can read, navigate, and reason over technical content effectively. Learn more at gitbook.com.

## Querying This Documentation
If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://wentao-shao.gitbook.io/leetcode/dynamic-programming/1.position/198.house-robber.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.