From aaef82bac825b3c304913634903d0f29a82b6ae1 Mon Sep 17 00:00:00 2001
From: wu xiangkai <wuxiangkai@yonyou.com>
Date: Fri, 31 Oct 2025 11:06:08 +0800
Subject: [PATCH] =?UTF-8?q?feat:=202025-10-31=E6=89=93=E5=8D=A1?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 121.best-time-to-buy-and-sell-stock.java     | 22 ++++++++++++
 123.best-time-to-buy-and-sell-stock-iii.java | 37 ++++++++++++++++++++
 152.maximum-product-subarray.java            | 32 +++++++++++++++++
 3 files changed, 91 insertions(+)
 create mode 100644 121.best-time-to-buy-and-sell-stock.java
 create mode 100644 123.best-time-to-buy-and-sell-stock-iii.java
 create mode 100644 152.maximum-product-subarray.java

diff --git a/121.best-time-to-buy-and-sell-stock.java b/121.best-time-to-buy-and-sell-stock.java
new file mode 100644
index 0000000..975f151
--- /dev/null
+++ b/121.best-time-to-buy-and-sell-stock.java
@@ -0,0 +1,22 @@
+/*
+ * @lc app=leetcode id=121 lang=java
+ *
+ * [121] Best Time to Buy and Sell Stock
+ */
+
+// @lc code=start
+class Solution {
+    public int maxProfit(int[] prices) {
+        if(prices == null || prices.length == 0) {
+            return 0;
+        }   
+        int min = prices[0], profit = 0;
+        for(int i=1; i<prices.length; i++) {
+            profit = Math.max(profit, prices[i] - min);
+            min = Math.min(min, prices[i]);
+        }
+        return profit;
+    }
+}
+// @lc code=end
+
diff --git a/123.best-time-to-buy-and-sell-stock-iii.java b/123.best-time-to-buy-and-sell-stock-iii.java
new file mode 100644
index 0000000..9e6c59e
--- /dev/null
+++ b/123.best-time-to-buy-and-sell-stock-iii.java
@@ -0,0 +1,37 @@
+/*
+ * @lc app=leetcode id=123 lang=java
+ *
+ * [123] Best Time to Buy and Sell Stock III
+ */
+
+// @lc code=start
+class Solution {
+    public int maxProfit(int[] prices) {
+        int[] ldp = new int[prices.length];
+        int[] rdp = new int[prices.length];
+        for(int i=0; i<ldp.length; i++) {
+            ldp[i] = 0;
+            rdp[i] = 0;
+        }
+        int lmin = prices[0], maxProfit=0;
+        for(int i=1; i<ldp.length; i++) {
+            maxProfit = Math.max(maxProfit, prices[i]-lmin);
+            lmin = Math.min(lmin, prices[i]);
+            ldp[i] = maxProfit;
+        }
+        int rmax = prices[prices.length-1];
+        maxProfit = 0;
+        for(int i=rdp.length-2; i>=0; i--) {
+            maxProfit = Math.max(maxProfit, rmax - prices[i]);
+            rmax = Math.max(rmax, prices[i]);
+            rdp[i] = maxProfit;
+        }
+        int profit = ldp[ldp.length-1];
+        for(int i=0; i<ldp.length-1; i++) {
+            profit = Math.max(profit, ldp[i] + rdp[i+1]);
+        }
+        return profit;
+    }
+}
+// @lc code=end
+
diff --git a/152.maximum-product-subarray.java b/152.maximum-product-subarray.java
new file mode 100644
index 0000000..18361d7
--- /dev/null
+++ b/152.maximum-product-subarray.java
@@ -0,0 +1,32 @@
+/*
+ * @lc app=leetcode id=152 lang=java
+ *
+ * [152] Maximum Product Subarray
+ */
+
+// @lc code=start
+class Solution {
+    public int maxProduct(int[] nums) {
+        int min = 1, max = 1, r = nums[0], curMax, curMin;
+        for(int i = 0; i< nums.length; i++) {
+            if(nums[i] == 0) {
+                max = min = 0;
+                r = Math.max(r, 0);
+            } else if(nums[i] > 0) {
+                curMax = Math.max(nums[i], max*nums[i]);
+                curMin = Math.min(nums[i], min*nums[i]);
+                max = curMax;
+                min = curMin;
+            } else {
+                curMax = Math.max(min * nums[i], nums[i]);
+                curMin = Math.min(max*nums[i], nums[i]);
+                max = curMax;
+                min = curMin;
+            }
+            r = Math.max(max, r);
+        }
+        return r;
+    }
+}
+// @lc code=end
+