题目:
根据每日 气温 列表,请重新生成一个列表,对应位置的输入是你需要再等待多久温度才会升高的天数。如果之后都不会升高,请输入 0 来代替。
例如,给定一个列表 temperatures = [73, 74, 75, 71, 69, 72, 76, 73],你的输出应该是 [1, 1, 4, 2, 1, 1, 0, 0]。
提示:气温 列表长度的范围是 [1, 30000]。每个气温的值的都是 [30, 100] 范围内的整数。
通过此题掌握JAVA中栈的使用
题目分析:
此题依然是利用栈
的知识,最后结果是
输出数组中元素的距离之差
,所以在栈中要存储数组下标
而不是存储数组元素
代码实现:
public int[] dailyTemperatures(int[] temperatures)
{
Stack<Integer> stack = new Stack<>();
int size = temperatures.length;
int[] result = new int[size];
Arrays.fill(result,0);
for (int i = 0; i < size; i++)
{
while (!stack.isEmpty() && temperatures[stack.peek()] < temperatures[i])
{
int t = stack.peek();
stack.pop();
result[t] = i - t;
}
stack.push(i);
}
return result;
算法详解:
以主函数中的数组[73,74,75,71,69,72,76,73]为例
- 刚开始,result数组初值都为0,即result = [0, 0, 0, 0, 0, 0, 0, 0]
- i = 0,将0入栈,此时stack = [0]
- i = 1,栈不空,进入while循环,temperatures[0] = 73 < temperatures[1] = 74, result[0] = 1 - 0 = 1
- result = [1, 0, 0, 0, 0, 0, 0, 0], 将1入栈,此时stack = [1]
- i = 2,栈不空, 进入while循环,temperatures[1] = 74 < temperatures[2] = 75, result[1] = 2 - 1 = 1
- result = [1, 1, 0, 0, 0, 0, 0, 0], 将2入栈,此时stack = [2]
- i = 3,栈不空,进入while循环,temperatures[2] = 75 > temperatures[3] = 71,将3入栈,stack = [2,3]
- i = 4,栈不空,进入while循环,temperatures[3] = 71 > temperatures[4] = 69,将4入栈,stack =[2,3,4]
- i = 5,栈不空,进入while循环,temperatures[4] = 69 < temperatures[5] = 72,result[4] = 5 - 4 = 1
- result = [1, 1, 0, 0, 1, 0, 0, 0],temperatures[3] = 71 < temperatures[5] = 72,result[3] = 5 - 3 = 2
- result = [1, 1, 0, 2, 1, 0, 0, 0]
- temperatures[2] = 75 > temperatures[5] = 72,将5入栈,此时stack = [2,5]
- i = 6,栈不空,进入while循环,temperatures[5] = 72 < temperatures[6] = 76,result[5] = 6 - 5 = 1
- result = [1, 1, 0, 2, 1, 1, 0, 0],temperatures[2] = 75 < temperatures[6] = 76,result[2] = 6 - 2 = 4
- result = [1, 1, 4, 2, 1, 1, 0, 0],将6入栈,此时stack = [6]
- i = 7,栈不空,进入while循环,temperatures[6] = 76 > temperatures[7] = 73
- 将7进栈,此时stack = [6,7]
- for循环结束,最后result = [1, 1, 4, 2, 1, 1, 0, 0]