feat: add solutions to lc problem: No.0739.Daily Temperatures

Author: yanglbme

solution/0500-0599/0503.Next Greater Element II/README.md

@@ -128,7 +128,7 @@ func nextGreaterElements(nums []int) []int {
 			stk = stk[:len(stk)-1]
 		}
 		stk = append(stk, i%n)
-	}
+	} 
 	return res
 }
 ```

solution/0700-0799/0739.Daily Temperatures/README.md

@@ -17,14 +17,15 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
-栈实现，栈存放 T 中元素的的下标 i，结果用数组 res 存储。
+单调栈常见模型：找出每个数左/右边**离它最近的**且**比它大/小的数**。模板：
 
-遍历 T，遍历到 `T[i]` 时：
-
-- 若栈不为空，并且栈顶元素小于 `T[i]` 时，弹出栈顶元素 j，并且 `res[j]` 赋值为 `i - j`。
-- 然后将 i 压入栈中。
-
-最后返回结果数组 res 即可。
+```python
+stk = []
+for i in range(n):
+    while stk and check(stk[-1], i):
+        stk.pop()
+    stk.append(i)
+```
 
 <!-- tabs:start -->
 
@@ -34,15 +35,14 @@
 
 ```python
 class Solution:
-    def dailyTemperatures(self, T: List[int]) -> List[int]:
-        n = len(T)
-        res = [0 for _ in range(n)]
-        s = []
-        for i in range(n):
-            while s and T[s[-1]] < T[i]:
-                j = s.pop()
+    def dailyTemperatures(self, temperatures: List[int]) -> List[int]:
+        res = [0] * len(temperatures)
+        stk = []
+        for i, t in enumerate(temperatures):
+            while stk and temperatures[stk[-1]] < t:
+                j = stk.pop()
                 res[j] = i - j
-            s.append(i)
+            stk.append(i)
         return res
 ```
 
@@ -52,16 +52,16 @@ class Solution:
 
 ```java
 class Solution {
-    public int[] dailyTemperatures(int[] T) {
-        int n = T.length;
+    public int[] dailyTemperatures(int[] temperatures) {
+        int n = temperatures.length;
         int[] res = new int[n];
-        Deque<Integer> s = new ArrayDeque<>();
+        Deque<Integer> stk = new ArrayDeque<>();
         for (int i = 0; i < n; ++i) {
-            while (!s.isEmpty() && T[s.peek()] < T[i]) {
-                int j = s.pop();
+            while (!stk.isEmpty() && temperatures[stk.peek()] < temperatures[i]) {
+                int j = stk.pop();
                 res[j] = i - j;
             }
-            s.push(i);
+            stk.push(i);
         }
         return res;
     }
@@ -75,37 +75,37 @@ class Solution {
 ```cpp
 class Solution {
 public:
-    vector<int> dailyTemperatures(vector<int>& T) {
-        int n = T.size();
-        vector<int> ans(n);
-        stack<int> s;
-        for(int i = 0; i < n; ++i) {
-            while(!s.empty() && T[s.top()] < T[i]) {
-                int pre = s.top();
-                s.pop();
-                ans[pre] = i - pre;
+    vector<int> dailyTemperatures(vector<int> &temperatures) {
+        int n = temperatures.size();
+        vector<int> res(n);
+        stack<int> stk;
+        for (int i = 0; i < n; ++i)
+        {
+            while (!stk.empty() && temperatures[stk.top()] < temperatures[i])
+            {
+                res[stk.top()] = i - stk.top();
+                stk.pop();
             }
-            s.push(i);
+            stk.push(i);
         }
-        return ans;
+        return res;
     }
 };
 ```
 
 ### **Go**
 
 ```go
-func dailyTemperatures(T []int) []int {
-	n := len(T)
-	res := make([]int, n)
-	stack := make([]int, 0)
-	for i, v := range T {
-		for len(stack) != 0 && T[stack[len(stack)-1]] < v {
-			j := stack[len(stack)-1]
-			stack = stack[:len(stack)-1]
+func dailyTemperatures(temperatures []int) []int {
+	res := make([]int, len(temperatures))
+	var stk []int
+	for i, t := range temperatures {
+		for len(stk) > 0 && temperatures[stk[len(stk)-1]] < t {
+			j := stk[len(stk)-1]
 			res[j] = i - j
+			stk = stk[:len(stk)-1]
 		}
-		stack = append(stack, i)
+		stk = append(stk, i)
 	}
 	return res
 }

solution/0700-0799/0739.Daily Temperatures/README_EN.md

@@ -26,38 +26,43 @@ Each temperature will be an integer in the range <code>[30, 100]</code>.
 
 ## Solutions
 
+Easy solution with stack.
+
+Everytime a higher temperature is found, we update answer of the peak one in the stack.
+
+If the day with higher temperature is not found, we leave the ans to be the default `0`.
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 ```python
 class Solution:
-    def dailyTemperatures(self, T: List[int]) -> List[int]:
-        n = len(T)
-        res = [0 for _ in range(n)]
-        s = []
-        for i in range(n):
-            while s and T[s[-1]] < T[i]:
-                j = s.pop()
+    def dailyTemperatures(self, temperatures: List[int]) -> List[int]:
+        res = [0] * len(temperatures)
+        stk = []
+        for i, t in enumerate(temperatures):
+            while stk and temperatures[stk[-1]] < t:
+                j = stk.pop()
                 res[j] = i - j
-            s.append(i)
+            stk.append(i)
         return res
 ```
 
 ### **Java**
 
 ```java
 class Solution {
-    public int[] dailyTemperatures(int[] T) {
-        int n = T.length;
+    public int[] dailyTemperatures(int[] temperatures) {
+        int n = temperatures.length;
         int[] res = new int[n];
-        Deque<Integer> s = new ArrayDeque<>();
+        Deque<Integer> stk = new ArrayDeque<>();
         for (int i = 0; i < n; ++i) {
-            while (!s.isEmpty() && T[s.peek()] < T[i]) {
-                int j = s.pop();
+            while (!stk.isEmpty() && temperatures[stk.peek()] < temperatures[i]) {
+                int j = stk.pop();
                 res[j] = i - j;
             }
-            s.push(i);
+            stk.push(i);
         }
         return res;
     }
@@ -71,37 +76,37 @@ class Solution {
 ```cpp
 class Solution {
 public:
-    vector<int> dailyTemperatures(vector<int>& T) {
-        int n = T.size();
-        vector<int> ans(n);
-        stack<int> s;
-        for(int i = 0; i < n; ++i) {
-            while(!s.empty() && T[s.top()] < T[i]) {
-                int pre = s.top();
-                s.pop();
-                ans[pre] = i - pre;
+    vector<int> dailyTemperatures(vector<int> &temperatures) {
+        int n = temperatures.size();
+        vector<int> res(n);
+        stack<int> stk;
+        for (int i = 0; i < n; ++i)
+        {
+            while (!stk.empty() && temperatures[stk.top()] < temperatures[i])
+            {
+                res[stk.top()] = i - stk.top();
+                stk.pop();
             }
-            s.push(i);
+            stk.push(i);
         }
-        return ans;
+        return res;
     }
 };
 ```
 
 ### **Go**
 
 ```go
-func dailyTemperatures(T []int) []int {
-	n := len(T)
-	res := make([]int, n)
-	stack := make([]int, 0)
-	for i, v := range T {
-		for len(stack) != 0 && T[stack[len(stack)-1]] < v {
-			j := stack[len(stack)-1]
-			stack = stack[:len(stack)-1]
+func dailyTemperatures(temperatures []int) []int {
+	res := make([]int, len(temperatures))
+	var stk []int
+	for i, t := range temperatures {
+		for len(stk) > 0 && temperatures[stk[len(stk)-1]] < t {
+			j := stk[len(stk)-1]
 			res[j] = i - j
+			stk = stk[:len(stk)-1]
 		}
-		stack = append(stack, i)
+		stk = append(stk, i)
 	}
 	return res
 }

solution/0700-0799/0739.Daily Temperatures/Solution.cpp

@@ -1,20 +1,18 @@
-/**
- *  Author: Moriarty12138
- */
 class Solution {
 public:
-    vector<int> dailyTemperatures(vector<int>& T) {
-        int n = T.size();
-        vector<int> ans(n);
-        stack<int> s;
-        for(int i = 0; i < n; ++i) {
-            while(!s.empty() && T[s.top()] < T[i]) {
-                int pre = s.top();
-                s.pop();
-                ans[pre] = i - pre;
+    vector<int> dailyTemperatures(vector<int> &temperatures) {
+        int n = temperatures.size();
+        vector<int> res(n);
+        stack<int> stk;
+        for (int i = 0; i < n; ++i)
+        {
+            while (!stk.empty() && temperatures[stk.top()] < temperatures[i])
+            {
+                res[stk.top()] = i - stk.top();
+                stk.pop();
             }
-            s.push(i);
+            stk.push(i);
         }
-        return ans;
+        return res;
     }
-};
+};

solution/0700-0799/0739.Daily Temperatures/Solution.go

@@ -1,14 +1,13 @@
-func dailyTemperatures(T []int) []int {
-	n := len(T)
-	res := make([]int, n)
-	stack := make([]int, 0)
-	for i, v := range T {
-		for len(stack) != 0 && T[stack[len(stack)-1]] < v {
-			j := stack[len(stack)-1]
-			stack = stack[:len(stack)-1]
+func dailyTemperatures(temperatures []int) []int {
+	res := make([]int, len(temperatures))
+	var stk []int
+	for i, t := range temperatures {
+		for len(stk) > 0 && temperatures[stk[len(stk)-1]] < t {
+			j := stk[len(stk)-1]
 			res[j] = i - j
+			stk = stk[:len(stk)-1]
 		}
-		stack = append(stack, i)
+		stk = append(stk, i)
 	}
 	return res
-}
+}

solution/0700-0799/0739.Daily Temperatures/Solution.java

@@ -1,14 +1,14 @@
 class Solution {
-    public int[] dailyTemperatures(int[] T) {
-        int n = T.length;
+    public int[] dailyTemperatures(int[] temperatures) {
+        int n = temperatures.length;
         int[] res = new int[n];
-        Deque<Integer> s = new ArrayDeque<>();
+        Deque<Integer> stk = new ArrayDeque<>();
         for (int i = 0; i < n; ++i) {
-            while (!s.isEmpty() && T[s.peek()] < T[i]) {
-                int j = s.pop();
+            while (!stk.isEmpty() && temperatures[stk.peek()] < temperatures[i]) {
+                int j = stk.pop();
                 res[j] = i - j;
             }
-            s.push(i);
+            stk.push(i);
         }
         return res;
     }

solution/0700-0799/0739.Daily Temperatures/Solution.py

@@ -1,11 +1,10 @@
 class Solution:
-    def dailyTemperatures(self, T: List[int]) -> List[int]:
-        n = len(T)
-        res = [0 for _ in range(n)]
-        s = []
-        for i in range(n):
-            while s and T[s[-1]] < T[i]:
-                j = s.pop()
+    def dailyTemperatures(self, temperatures: List[int]) -> List[int]:
+        res = [0] * len(temperatures)
+        stk = []
+        for i, t in enumerate(temperatures):
+            while stk and temperatures[stk[-1]] < t:
+                j = stk.pop()
                 res[j] = i - j
-            s.append(i)
+            stk.append(i)
         return res