From 8bab33d0bba8a080fb614bec6be3b0a5961d7727 Mon Sep 17 00:00:00 2001
From: wang <472146630@qq.com>
Date: Tue, 10 May 2022 21:27:54 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=200300.=E6=9C=80=E9=95=BF?=
 =?UTF-8?q?=E4=B8=8A=E5=8D=87=E5=AD=90=E5=BA=8F=E5=88=97=E3=80=810322.?=
 =?UTF-8?q?=E9=9B=B6=E9=92=B1=E5=85=91=E6=8D=A2=E3=80=810518.=E9=9B=B6?=
 =?UTF-8?q?=E9=92=B1=E5=85=91=E6=8D=A2II=20=E5=92=8C0674.=E6=9C=80?=
 =?UTF-8?q?=E9=95=BF=E8=BF=9E=E7=BB=AD=E9=80=92=E5=A2=9E=E5=BA=8F=E5=88=97?=
 =?UTF-8?q?=E7=9A=84rust=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0300.最长上升子序列.md    | 17 +++++++++++++++++
 problems/0322.零钱兑换.md             | 20 +++++++++++++++++++-
 problems/0518.零钱兑换II.md           | 16 ++++++++++++++++
 problems/0674.最长连续递增序列.md | 19 +++++++++++++++++++
 4 files changed, 71 insertions(+), 1 deletion(-)

diff --git a/problems/0300.最长上升子序列.md b/problems/0300.最长上升子序列.md
index dfdd5125..f53d19a1 100644
--- a/problems/0300.最长上升子序列.md
+++ b/problems/0300.最长上升子序列.md
@@ -168,6 +168,23 @@ func lengthOfLIS(nums []int ) int {
 }
 ```
 
+Rust:
+```rust
+pub fn length_of_lis(nums: Vec<i32>) -> i32 {
+    let mut dp = vec![1; nums.len() + 1];
+    let mut result = 1;
+    for i in 1..nums.len() {
+        for j in 0..i {
+            if nums[j] < nums[i] {
+                dp[i] = dp[i].max(dp[j] + 1);
+            }
+            result = result.max(dp[i]);
+        }
+    }
+    result
+}
+```
+
 Javascript
 ```javascript
 const lengthOfLIS = (nums) => {
diff --git a/problems/0322.零钱兑换.md b/problems/0322.零钱兑换.md
index 3a8d0662..43c735be 100644
--- a/problems/0322.零钱兑换.md
+++ b/problems/0322.零钱兑换.md
@@ -220,7 +220,7 @@ class Solution:
             for j in range(coin, amount + 1):
                 dp[j] = min(dp[j], dp[j - coin] + 1)
         return dp[amount] if dp[amount] < amount + 1 else -1
-    
+
     def coinChange1(self, coins: List[int], amount: int) -> int:
         '''版本二'''
         # 初始化
@@ -302,6 +302,24 @@ func min(a, b int) int {
 
 ```
 
+Rust:
+
+```rust
+pub fn coin_change(coins: Vec<i32>, amount: i32) -> i32 {
+    let amount = amount as usize;
+    let mut dp = vec![i32::MAX; amount + 1];
+    dp[0] = 0;
+    for i in 0..coins.len() {
+        for j in coins[i] as usize..=amount {
+            if dp[j - coins[i] as usize] != i32::MAX {
+                dp[j] = dp[j].min(dp[j - coins[i] as usize] + 1);
+            }
+        }
+    }
+    if dp[amount] == i32::MAX { -1 } else { dp[amount] }
+}
+```
+
 Javascript：
 ```javascript
 const coinChange = (coins, amount) => {
diff --git a/problems/0518.零钱兑换II.md b/problems/0518.零钱兑换II.md
index e72c5f85..0e4a3987 100644
--- a/problems/0518.零钱兑换II.md
+++ b/problems/0518.零钱兑换II.md
@@ -242,6 +242,22 @@ func change(amount int, coins []int) int {
 }
 ```
 
+Rust:
+```rust
+pub fn change(amount: i32, coins: Vec<i32>) -> i32 {
+    let amount = amount as usize;
+    let coins = coins.iter().map(|&c|c as usize).collect::<Vec<usize>>();
+    let mut dp = vec![0usize; amount + 1];
+    dp[0] = 1;
+    for i in 0..coins.len() {
+        for j in coins[i]..=amount {
+            dp[j] += dp[j - coins[i]];
+        }
+    }
+    dp[amount] as i32
+}
+```
+
 Javascript：
 ```javascript
 const change = (amount, coins) => {
diff --git a/problems/0674.最长连续递增序列.md b/problems/0674.最长连续递增序列.md
index e941d242..36471490 100644
--- a/problems/0674.最长连续递增序列.md
+++ b/problems/0674.最长连续递增序列.md
@@ -218,6 +218,7 @@ class Solution:
         return result
 ```
 
+
 > 贪心法：
 ```python
 class Solution:
@@ -237,6 +238,24 @@ class Solution:
 
 Go：
 
+Rust:
+```rust
+pub fn find_length_of_lcis(nums: Vec<i32>) -> i32 {
+    if nums.is_empty() {
+        return 0;
+    }
+    let mut result = 1;
+    let mut dp = vec![1; nums.len()];
+    for i in 1..nums.len() {
+        if nums[i - 1] < nums[i] {
+            dp[i] = dp[i - 1] + 1;
+            result = result.max(dp[i]);
+        }
+    }
+    result
+}
+```
+
 Javascript：
 
 > 动态规划：