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

@@ -53,7 +53,19 @@
 
 **方法一：单调栈**
 
-时间复杂度 $O(n)$，其中 $n$ 表示 $prices$ 的长度。
+单调栈常见模型：找出每个数左/右边**离它最近的**且**比它大/小的数**。模板：
+
+```python
+stk = []
+for i in range(n):
+    while stk and check(stk[-1], i):
+        stk.pop()
+    stk.append(i)
+```
+
+本题我们可以采用正序、逆序两种方式遍历数组 `prices`。
+
+时间复杂度 $O(n)$，其中 $n$ 表示数组 `prices` 的长度。
 
 <!-- tabs:start -->
 
@@ -73,6 +85,20 @@ class Solution:
         return ans
 ```
 
+```python
+class Solution:
+    def finalPrices(self, prices: List[int]) -> List[int]:
+        stk = []
+        ans = prices[:]
+        for i in range(len(prices) - 1, -1, -1):
+            while stk and prices[stk[-1]] > prices[i]:
+                stk.pop()
+            if stk:
+                ans[i] -= prices[stk[-1]]
+            stk.append(i)
+        return ans
+```
+
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
@@ -95,6 +121,27 @@ class Solution {
 }
 ```
 
+```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 = n - 1; i >= 0; --i) {
+            ans[i] = prices[i];
+            while (!stk.isEmpty() && prices[stk.peek()] > prices[i]) {
+                stk.pop();
+            }
+            if (!stk.isEmpty()) {
+                ans[i] -= prices[stk.peek()];
+            }
+            stk.push(i);
+        }
+        return ans;
+    }
+}
+```
+
 ### **C++**
 
 ```cpp
@@ -115,6 +162,28 @@ public:
 };
 ```
 
+```cpp
+class Solution {
+public:
+    vector<int> finalPrices(vector<int>& prices) {
+        stack<int> stk;
+        int n = prices.size();
+        vector<int> ans(n);
+        for (int i = n - 1; i >= 0; --i) {
+            ans[i] = prices[i];
+            while (!stk.empty() && prices[stk.top()] > prices[i]) {
+                stk.pop();
+            }
+            if (!stk.empty()) {
+                ans[i] -= prices[stk.top()];
+            }
+            stk.push(i);
+        }
+        return ans;
+    }
+};
+```
+
 ### **Go**
 
 ```go
@@ -134,8 +203,43 @@ func finalPrices(prices []int) []int {
 }
 ```
 
+```go
+func finalPrices(prices []int) []int {
+	stk := []int{}
+	n := len(prices)
+	ans := make([]int, n)
+	for i := n - 1; i >= 0; i-- {
+		ans[i] = prices[i]
+		for len(stk) > 0 && prices[stk[len(stk)-1]] > prices[i] {
+			stk = stk[:len(stk)-1]
+		}
+		if len(stk) > 0 {
+			ans[i] -= prices[stk[len(stk)-1]]
+		}
+		stk = append(stk, i)
+	}
+	return ans
+}
+```
+
 ### **TypeScript**
 
+```ts
+function finalPrices(prices: number[]): number[] {
+    const n = prices.length;
+    const stk = [];
+    const ans = new Array(n);
+    for (let i = 0; i < n; ++i) {
+        ans[i] = prices[i];
+        while (stk.length && prices[stk[stk.length - 1]] >= prices[i]) {
+            ans[stk.pop()] -= prices[i];
+        }
+        stk.push(i);
+    }
+    return ans;
+}
+```
+
 ```ts
 function finalPrices(prices: number[]): number[] {
     const n = prices.length;

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

@@ -62,6 +62,20 @@ class Solution:
         return ans
 ```
 
+```python
+class Solution:
+    def finalPrices(self, prices: List[int]) -> List[int]:
+        stk = []
+        ans = prices[:]
+        for i in range(len(prices) - 1, -1, -1):
+            while stk and prices[stk[-1]] > prices[i]:
+                stk.pop()
+            if stk:
+                ans[i] -= prices[stk[-1]]
+            stk.append(i)
+        return ans
+```
+
 ### **Java**
 
 ```java
@@ -82,6 +96,27 @@ class Solution {
 }
 ```
 
+```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 = n - 1; i >= 0; --i) {
+            ans[i] = prices[i];
+            while (!stk.isEmpty() && prices[stk.peek()] > prices[i]) {
+                stk.pop();
+            }
+            if (!stk.isEmpty()) {
+                ans[i] -= prices[stk.peek()];
+            }
+            stk.push(i);
+        }
+        return ans;
+    }
+}
+```
+
 ### **C++**
 
 ```cpp
@@ -102,6 +137,28 @@ public:
 };
 ```
 
+```cpp
+class Solution {
+public:
+    vector<int> finalPrices(vector<int>& prices) {
+        stack<int> stk;
+        int n = prices.size();
+        vector<int> ans(n);
+        for (int i = n - 1; i >= 0; --i) {
+            ans[i] = prices[i];
+            while (!stk.empty() && prices[stk.top()] > prices[i]) {
+                stk.pop();
+            }
+            if (!stk.empty()) {
+                ans[i] -= prices[stk.top()];
+            }
+            stk.push(i);
+        }
+        return ans;
+    }
+};
+```
+
 ### **Go**
 
 ```go
@@ -121,8 +178,43 @@ func finalPrices(prices []int) []int {
 }
 ```
 
+```go
+func finalPrices(prices []int) []int {
+	stk := []int{}
+	n := len(prices)
+	ans := make([]int, n)
+	for i := n - 1; i >= 0; i-- {
+		ans[i] = prices[i]
+		for len(stk) > 0 && prices[stk[len(stk)-1]] > prices[i] {
+			stk = stk[:len(stk)-1]
+		}
+		if len(stk) > 0 {
+			ans[i] -= prices[stk[len(stk)-1]]
+		}
+		stk = append(stk, i)
+	}
+	return ans
+}
+```
+
 ### **TypeScript**
 
+```ts
+function finalPrices(prices: number[]): number[] {
+    const n = prices.length;
+    const stk = [];
+    const ans = new Array(n);
+    for (let i = 0; i < n; ++i) {
+        ans[i] = prices[i];
+        while (stk.length && prices[stk[stk.length - 1]] >= prices[i]) {
+            ans[stk.pop()] -= prices[i];
+        }
+        stk.push(i);
+    }
+    return ans;
+}
+```
+
 ```ts
 function finalPrices(prices: number[]): number[] {
     const n = prices.length;