Description
Given a list of daily temperatures T, return a list such that, for each day in the input, tells you how many days you would have to wait until a warmer temperature. If there is no future day for which this is possible, put 0 instead.
For example, given the list of temperatures T = [73, 74, 75, 71, 69, 72, 76, 73], your output should be [1, 1, 4, 2, 1, 1, 0, 0].
Note: The length of temperatures will be in the range [1, 30000]. Each temperature will be an integer in the range [30, 100].
Solution
给一个表示温度的数组,返回对于每一天,几天之后才会有更高的温度。
-
Brute force
Using two iteration to calculate how many days it need to meet a warmer weather. Then store them in result array. -
Using Stack
Using a stack to store the descending numbers. If there is a number bigger than the peek element in stack, pop it and calculte days. After that push it into stack.
Code
- Brute force
class Solution {
public int[] dailyTemperatures(int[] T) {
int[] res = new int[T.length];
for (int i = 0; i < T.length; i++){
for (int j = i + 1; j < T.length; j++){
if (T[j] > T[i]){
res[i] = j - i;
break;
}
}
}
return res;
}
}
- Using stack
class Solution {
public int[] dailyTemperatures(int[] T) {
int[] res = new int[T.length];
Stack<Integer> stack = new Stack<>();
for (int i = 0; i < T.length; i++){
while (!stack.isEmpty() && T[i] > T[stack.peek()]){
int index = stack.pop();
res[index] = i - index;
}
stack.push(i);
}
return res;
}
}
Time Complexity: O(n^2) O(n)
Space Complexity: O(1) O(n)
Review
We could use an array to perform the duty of a stack, which would give the code better performance.