## 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**.

**Example 1:**

Input:nums = [1,2,3,1]Output:4Explanation: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:12Explanation: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:**

`0 <= nums.length <= 100`

`0 <= nums[i] <= 400`

## Rust Solution

```
struct Solution;
use std::cmp::Ordering::*;
impl Solution {
fn rob(nums: Vec<i32>) -> i32 {
let n = nums.len();
let mut max = vec![0; n];
for i in 0..n {
match i.cmp(&2) {
Less => {
max[i] = nums[i];
}
Equal => {
max[2] = nums[2] + nums[0];
}
Greater => {
max[i] = nums[i] + i32::max(max[i - 2], max[i - 3]);
}
}
}
let mut res = 0;
for i in 0..n {
res = i32::max(max[i], res);
}
res
}
}
#[test]
fn test() {
let nums = vec![1, 2, 3, 1];
assert_eq!(Solution::rob(nums), 4);
let nums = vec![2, 7, 9, 3, 1];
assert_eq!(Solution::rob(nums), 12);
}
```

Having problems with this solution? Click here to submit an issue on github.