feat: add solutions to lc problem: No.1475

No.1475.Final Prices With a Special Discount in a Shop

Author: yanglbme

solution/1400-1499/1475.Final Prices With a Special Discount in a Shop/README.md

@@ -51,22 +51,89 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+**方法一：单调栈**
+
+时间复杂度 $O(n)$，其中 $n$ 表示 $prices$ 的长度。
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def finalPrices(self, prices: List[int]) -> List[int]:
+        stk = []
+        ans = prices[:]
+        for i, v in enumerate(prices):
+            while stk and prices[stk[-1]] >= v:
+                ans[stk.pop()] -= v
+            stk.append(i)
+        return ans
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public int[] finalPrices(int[] prices) {
+        Deque<Integer> stk = new ArrayDeque<>();
+        int n = prices.length;
+        int[] ans = new int[n];
+        for (int i = 0; i < n; ++i) {
+            ans[i] = prices[i];
+            while (!stk.isEmpty() && prices[stk.peek()] >= prices[i]) {
+                ans[stk.pop()] -= prices[i];
+            }
+            stk.push(i);
+        }
+        return ans;
+    }
+}
+```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    vector<int> finalPrices(vector<int>& prices) {
+        stack<int> stk;
+        vector<int> ans = prices;
+        for (int i = 0; i < prices.size(); ++i)
+        {
+            while (!stk.empty() && prices[stk.top()] >= prices[i])
+            {
+                ans[stk.top()] -= prices[i];
+                stk.pop();
+            }
+            stk.push(i);
+        }
+        return ans;
+    }
+};
+```
+
+### **Go**
+
+```go
+func finalPrices(prices []int) []int {
+	var stk []int
+	n := len(prices)
+	ans := make([]int, n)
+	for i, v := range prices {
+		ans[i] = v
+		for len(stk) > 0 && prices[stk[len(stk)-1]] >= v {
+			ans[stk[len(stk)-1]] -= v
+			stk = stk[:len(stk)-1]
+		}
+		stk = append(stk, i)
+	}
+	return ans
+}
 ```
 
 ### **TypeScript**

solution/1400-1499/1475.Final Prices With a Special Discount in a Shop/README_EN.md

@@ -51,13 +51,76 @@ For items 3 and 4 you will not receive any discount at all.
 ### **Python3**
 
 ```python
-
+class Solution:
+    def finalPrices(self, prices: List[int]) -> List[int]:
+        stk = []
+        ans = prices[:]
+        for i, v in enumerate(prices):
+            while stk and prices[stk[-1]] >= v:
+                ans[stk.pop()] -= v
+            stk.append(i)
+        return ans
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public int[] finalPrices(int[] prices) {
+        Deque<Integer> stk = new ArrayDeque<>();
+        int n = prices.length;
+        int[] ans = new int[n];
+        for (int i = 0; i < n; ++i) {
+            ans[i] = prices[i];
+            while (!stk.isEmpty() && prices[stk.peek()] >= prices[i]) {
+                ans[stk.pop()] -= prices[i];
+            }
+            stk.push(i);
+        }
+        return ans;
+    }
+}
+```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    vector<int> finalPrices(vector<int>& prices) {
+        stack<int> stk;
+        vector<int> ans = prices;
+        for (int i = 0; i < prices.size(); ++i)
+        {
+            while (!stk.empty() && prices[stk.top()] >= prices[i])
+            {
+                ans[stk.top()] -= prices[i];
+                stk.pop();
+            }
+            stk.push(i);
+        }
+        return ans;
+    }
+};
+```
+
+### **Go**
+
+```go
+func finalPrices(prices []int) []int {
+	var stk []int
+	n := len(prices)
+	ans := make([]int, n)
+	for i, v := range prices {
+		ans[i] = v
+		for len(stk) > 0 && prices[stk[len(stk)-1]] >= v {
+			ans[stk[len(stk)-1]] -= v
+			stk = stk[:len(stk)-1]
+		}
+		stk = append(stk, i)
+	}
+	return ans
+}
 ```
 
 ### **TypeScript**

solution/1400-1499/1475.Final Prices With a Special Discount in a Shop/Solution.cpp

@@ -0,0 +1,17 @@
+class Solution {
+public:
+    vector<int> finalPrices(vector<int>& prices) {
+        stack<int> stk;
+        vector<int> ans = prices;
+        for (int i = 0; i < prices.size(); ++i)
+        {
+            while (!stk.empty() && prices[stk.top()] >= prices[i])
+            {
+                ans[stk.top()] -= prices[i];
+                stk.pop();
+            }
+            stk.push(i);
+        }
+        return ans;
+    }
+};

solution/1400-1499/1475.Final Prices With a Special Discount in a Shop/Solution.go

@@ -0,0 +1,14 @@
+func finalPrices(prices []int) []int {
+	var stk []int
+	n := len(prices)
+	ans := make([]int, n)
+	for i, v := range prices {
+		ans[i] = v
+		for len(stk) > 0 && prices[stk[len(stk)-1]] >= v {
+			ans[stk[len(stk)-1]] -= v
+			stk = stk[:len(stk)-1]
+		}
+		stk = append(stk, i)
+	}
+	return ans
+}

solution/1400-1499/1475.Final Prices With a Special Discount in a Shop/Solution.java

@@ -0,0 +1,15 @@
+class Solution {
+    public int[] finalPrices(int[] prices) {
+        Deque<Integer> stk = new ArrayDeque<>();
+        int n = prices.length;
+        int[] ans = new int[n];
+        for (int i = 0; i < n; ++i) {
+            ans[i] = prices[i];
+            while (!stk.isEmpty() && prices[stk.peek()] >= prices[i]) {
+                ans[stk.pop()] -= prices[i];
+            }
+            stk.push(i);
+        }
+        return ans;
+    }
+}

solution/1400-1499/1475.Final Prices With a Special Discount in a Shop/Solution.py

@@ -0,0 +1,9 @@
+class Solution:
+    def finalPrices(self, prices: List[int]) -> List[int]:
+        stk = []
+        ans = prices[:]
+        for i, v in enumerate(prices):
+            while stk and prices[stk[-1]] >= v:
+                ans[stk.pop()] -= v
+            stk.append(i)
+        return ans

solution/main.py

@@ -206,17 +206,17 @@ def save(result):
 
 
 if __name__ == '__main__':
-    # cookie_cn = ''
-    # cookie_en = ''
-    # spider = Spider(cookie_cn, cookie_en)
-    # res = spider.run()
-    # save(res)
+    cookie_cn = ''
+    cookie_en = ''
+    spider = Spider(cookie_cn, cookie_en)
+    res = spider.run()
+    save(res)
 
     with open('./result.json', 'r', encoding='utf-8') as f:
         res = f.read()
         res = json.loads(res)
 
-    # generate_readme(res)
-    # generate_question_readme(res)
-    # generate_summary(res)
-    refresh(res)
+    generate_readme(res)
+    generate_question_readme(res)
+    generate_summary(res)
+    # refresh(res)