import java.util.Stack;
/**
<p>给定一个整数数组 <code>temperatures</code> ,表示每天的温度,返回一个数组 <code>answer</code> ,其中 <code>answer[i]</code> 是指在第 <code>i</code> 天之后,<span ><span ><span ><span ><font face="宋体">才会有更高的温度</font></span></span></span></span>。如果气温在这之后都不会升高,请在该位置用 <code>0</code> 来代替。</p>
<p> </p>
<p><strong>示例 1:</strong></p>
<pre>
<strong>输入:</strong> <code>temperatures</code> = [73,74,75,71,69,72,76,73]
<strong>输出:</strong> [1,1,4,2,1,1,0,0]
</pre>
<p><strong>示例 2:</strong></p>
<pre>
<strong>输入:</strong> temperatures = [30,40,50,60]
<strong>输出:</strong> [1,1,1,0]
</pre>
<p><strong>示例 3:</strong></p>
<pre>
<strong>输入:</strong> temperatures = [30,60,90]
<strong>输出: </strong>[1,1,0]</pre>
<p> </p>
<p><strong>提示:</strong></p>
<ul>
<li><code>1 <= temperatures.length <= 10<sup>5</sup></code></li>
<li><code>30 <= temperatures[i] <= 100</code></li>
</ul>
<div><div>Related Topics</div><div><li>栈</li><li>数组</li><li>单调栈</li></div></div><br><div><li>???? 1122</li><li>???? 0</li></div>
*/
//leetcode submit region begin(Prohibit modification and deletion)
class Solution {
//单调栈,只是换成坐标进行计算,注意判断那块 小于等于都要去掉
public int[] dailyTemperatures(int[] temperatures) {
int[] res = new int[temperatures.length];
Stack<Integer> s = new Stack<>();
for (int i = temperatures.length-1 ; i >= 0 ; i--) {
while(!s.isEmpty() && temperatures[s.peek()]<=temperatures[i]){
s.pop();
}
res[i] = (s.isEmpty() || temperatures[s.peek()]<=temperatures[i])?0:s.peek()-i;
s.push(i);
}
return res;
}
}
//leetcode submit region end(Prohibit modification and deletion)
不会,我可以学;落后,我可以追赶;跌倒,我可以站起来!