diff --git a/problems/0122.买卖股票的最佳时机II.md b/problems/0122.买卖股票的最佳时机II.md
index 0d8ad608..89c654fa 100644
--- a/problems/0122.买卖股票的最佳时机II.md
+++ b/problems/0122.买卖股票的最佳时机II.md
@@ -322,13 +322,10 @@ function maxProfit(prices: number[]): number {
 
 ```Rust
 impl Solution {
-    fn max(a: i32, b: i32) -> i32 {
-        if a > b { a } else { b }
-    }
     pub fn max_profit(prices: Vec<i32>) -> i32 {
         let mut result = 0;
         for i in 1..prices.len() {
-            result += Self::max(prices[i] - prices[i - 1], 0);
+            result += (prices[i] - prices[i - 1]).max(0);
         }
         result
     }
@@ -339,18 +336,14 @@ impl Solution {
 
 ```Rust
 impl Solution {
-    fn max(a: i32, b: i32) -> i32 {
-        if a > b { a } else { b }
-    }
     pub fn max_profit(prices: Vec<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]);
+        let mut dp = vec![vec![0; 2]; prices.len()];
+        dp[0][0] = -prices[0];
+        for i in 1..prices.len() {
+            dp[i][0] = dp[i - 1][0].max(dp[i - 1][1] - prices[i]);
+            dp[i][1] = dp[i - 1][1].max(dp[i - 1][0] + prices[i]);
         }
-        Self::max(dp[n - 1][0], dp[n - 1][1])
+        dp[prices.len() - 1][1]
     }
 }
 ```