Skip to content

Latest commit

 

History

History
58 lines (42 loc) · 1.34 KB

20210310.md

File metadata and controls

58 lines (42 loc) · 1.34 KB

Algorithm

739. Daily Temperatures

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

class Solution {
  public int[] dailyTemperatures(int[] T) {
    for(int i=0;i<T.length;i++){
        int j=i;
        for(;j<T.length;j++){
            if(T[i]<T[j]){
                T[i]=j-i;
                break;
            }
        }
        if(j==T.length) T[i]=0;
    }
    return T;
}
class Solution {
    public int[] dailyTemperatures(int[] T) {
        int[] result = new int[T.length];
        Stack<Integer> stack = new Stack<>();
        for (int i = 0; i < T.length; i++) {
            while (!stack.empty() && T[stack.peek()] < T[i]) {
                ans[stack.peek()] = i - stack.pop();
            }
            stack.push(i);
        }
        return result;
    }
}

Discuss

Review

Tip

Share