g0701_0800.s0739_daily_temperatures.Solution Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java21 Show documentation

Java-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.38

package g0701_0800.s0739_daily_temperatures;

// #Medium #Top_100_Liked_Questions #Array #Stack #Monotonic_Stack #Programming_Skills_II_Day_6
// #Big_O_Time_O(n)_Space_O(n) #2022_03_25_Time_10_ms_(94.99%)_Space_118.3_MB_(70.21%)

/**
 * 739 - Daily Temperatures\.
 *
 * Medium
 *
 * Given an array of integers `temperatures` represents the daily temperatures, return _an array_ `answer` _such that_ `answer[i]` _is the number of days you have to wait after the_ i^th _day to get a warmer temperature_. If there is no future day for which this is possible, keep `answer[i] == 0` instead.
 *
 * **Example 1:**
 *
 * **Input:** temperatures = [73,74,75,71,69,72,76,73]
 *
 * **Output:** [1,1,4,2,1,1,0,0] 
 *
 * **Example 2:**
 *
 * **Input:** temperatures = [30,40,50,60]
 *
 * **Output:** [1,1,1,0] 
 *
 * **Example 3:**
 *
 * **Input:** temperatures = [30,60,90]
 *
 * **Output:** [1,1,0] 
 *
 * **Constraints:**
 *
 * *   1 <= temperatures.length <= 10⁵
 * *   `30 <= temperatures[i] <= 100`
**/
@SuppressWarnings("java:S135")
public class Solution {
    public int[] dailyTemperatures(int[] temperatures) {
        int[] sol = new int[temperatures.length];
        sol[temperatures.length - 1] = 0;
        for (int i = sol.length - 2; i >= 0; i--) {
            int j = i + 1;
            while (j <= sol.length) {
                if (temperatures[i] < temperatures[j]) {
                    sol[i] = j - i;
                    break;
                } else {
                    if (sol[j] == 0) {
                        break;
                    }
                    j = j + sol[j];
                }
            }
        }
        return sol;
    }
}