From 477f4595749ea6d38b22f3bac14cdc35c8aa2191 Mon Sep 17 00:00:00 2001
From: fwqaaq <fwqaaq@gmail.com>
Date: Fri, 2 Jun 2023 22:24:44 +0800
Subject: [PATCH] =?UTF-8?q?Update=200213.=E6=89=93=E5=AE=B6=E5=8A=AB?=
 =?UTF-8?q?=E8=88=8DII.md=20about=20rust?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0213.打家劫舍II.md | 29 +++++++++++++++++++++++++++++
 1 file changed, 29 insertions(+)

diff --git a/problems/0213.打家劫舍II.md b/problems/0213.打家劫舍II.md
index 6395f3a8..494ad2bd 100644
--- a/problems/0213.打家劫舍II.md
+++ b/problems/0213.打家劫舍II.md
@@ -248,6 +248,35 @@ function robRange(nums: number[], start: number, end: number): number {
 }
 ```
 
+Rust:
+
+```rust
+impl Solution {
+    pub fn rob(nums: Vec<i32>) -> i32 {
+        match nums.len() {
+            1 => nums[0],
+            _ => Self::rob_range(&nums, 0, nums.len() - 2).max(Self::rob_range(
+                &nums,
+                1,
+                nums.len() - 1,
+            )),
+        }
+    }
+
+    pub fn rob_range(nums: &Vec<i32>, start: usize, end: usize) -> i32 {
+        if start == end {
+            return nums[start];
+        }
+        let mut dp = vec![0; nums.len()];
+        dp[start] = nums[start];
+        dp[start + 1] = nums[start].max(nums[start + 1]);
+        for i in start + 2..=end {
+            dp[i] = dp[i - 1].max(dp[i - 2] + nums[i]);
+        }
+        dp[end]
+    }
+}
+```
 
 
 <p align="center">