daily-temperatures

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given an array of integers <code>temperatures</code> represents the daily temperatures, return an array <code>answer</code> such that <code>answer[i]</code> is the number of days you have to wait after the <code>ith</code> day to get a warmer temperature. If there is no future day for which this is possible, keep <code>answer[i] == 0</code> instead.

&nbsp;
Example 1:
<pre>Input: temperatures = [73,74,75,71,69,72,76,73]
Output: [1,1,4,2,1,1,0,0]
</pre>Example 2:
<pre>Input: temperatures = [30,40,50,60]
Output: [1,1,1,0]
</pre>Example 3:
<pre>Input: temperatures = [30,60,90]
Output: [1,1,0]
</pre>
&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;=&nbsp;temperatures.length &lt;= 105</code></li>
	<li><code>30 &lt;=&nbsp;temperatures[i] &lt;= 100</code></li>
</ul>

dailyTemperatures

Daily Temperatures

Next Greater Element I

next-greater-element-i

下一个更大元素 I

Online Stock Span

online-stock-span

股票价格跨度

Stack

Array

Monotonic Stack

给定一个整数数组&nbsp;<code>temperatures</code>&nbsp;，表示每天的温度，返回一个数组&nbsp;<code>answer</code>&nbsp;，其中&nbsp;<code>answer[i]</code>&nbsp;是指对于第 <code>i</code> 天，下一个更高温度出现在几天后。如果气温在这之后都不会升高，请在该位置用&nbsp;<code>0</code> 来代替。

&nbsp;

示例 1:

<pre>
输入: <code>temperatures</code> = [73,74,75,71,69,72,76,73]
输出:&nbsp;[1,1,4,2,1,1,0,0]
</pre>

示例 2:

<pre>
输入: temperatures = [30,40,50,60]
输出:&nbsp;[1,1,1,0]
</pre>

示例 3:

<pre>
输入: temperatures = [30,60,90]
输出: [1,1,0]</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;=&nbsp;temperatures.length &lt;= 105</code></li>
	<li><code>30 &lt;=&nbsp;temperatures[i]&nbsp;&lt;= 100</code></li>
</ul>