From b802e83e435cb4cf23f13c699816dc2f77bf500c Mon Sep 17 00:00:00 2001
From: cezarbbb <105843128+cezarbbb@users.noreply.github.com>
Date: Sat, 6 Aug 2022 18:27:34 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=200714.=E4=B9=B0=E5=8D=96?=
 =?UTF-8?q?=E8=82=A1=E7=A5=A8=E7=9A=84=E6=9C=80=E4=BD=B3=E6=97=B6=E6=9C=BA?=
 =?UTF-8?q?=E5=90=AB=E6=89=8B=E7=BB=AD=E8=B4=B9=EF=BC=88=E5=8A=A8=E6=80=81?=
 =?UTF-8?q?=E8=A7=84=E5=88=92=EF=BC=89=20Rust=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

添加 0714.买卖股票的最佳时机含手续费（动态规划） Rust版本
---
 ...佳时机含手续费（动态规划）.md | 38 +++++++++++++++++++
 1 file changed, 38 insertions(+)

diff --git a/problems/0714.买卖股票的最佳时机含手续费（动态规划）.md b/problems/0714.买卖股票的最佳时机含手续费（动态规划）.md
index 7734450e..5ae8c33b 100644
--- a/problems/0714.买卖股票的最佳时机含手续费（动态规划）.md
+++ b/problems/0714.买卖股票的最佳时机含手续费（动态规划）.md
@@ -221,8 +221,46 @@ function maxProfit(prices: number[], fee: number): number {
 };
 ```
 
+Rust:
+**贪心**
+```Rust
+impl Solution {
+    pub fn max_profit(prices: Vec<i32>, fee: i32) -> i32 {
+        let mut result = 0;
+        let mut min_price = prices[0];
+        for i in 1..prices.len() {
+            if prices[i] < min_price { min_price = prices[i]; }
 
+            // if prices[i] >= min_price && prices[i] <= min_price + fee { continue; }
 
+            if prices[i] > min_price + fee {
+                result += prices[i] - min_price - fee;
+                min_price = prices[i] - fee;
+            }
+        }
+        result
+    }
+}
+```
+
+**动态规划**
+```Rust
+impl Solution {
+    fn max(a: i32, b: i32) -> i32 {
+        if a > b { a } else { b }
+    }
+    pub fn max_profit(prices: Vec<i32>, fee: i32) -> i32 {
+        let n = prices.len();
+        let mut dp = vec![vec![0; 2]; n];
+        dp[0][0] -= prices[0];
+        for i in 1..n {
+            dp[i][0] = Self::max(dp[i - 1][0], dp[i - 1][1] - prices[i]);
+            dp[i][1] = Self::max(dp[i - 1][1], dp[i - 1][0] + prices[i] - fee);
+        }
+        Self::max(dp[n - 1][0], dp[n - 1][1])
+    }
+}
+```
 
 -----------------------
 <div align="center"><img src=https://code-thinking.cdn.bcebos.com/pics/01二维码一.jpg width=500> </img></div>