[LintCode] Daily Temperatures

lemon 发布于2019-08-16 12:40 / 292人阅读

Problem

Given a list of daily temperatures, produce a list 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 temperatures = [73, 74, 75, 71, 69, 72, 76, 73], your output should be [1, 1, 4, 2, 1, 1, 0, 0].

Example

Input:
temperatures = [73, 74, 75, 71, 69, 72, 76, 73]
Output:
[1, 1, 4, 2, 1, 1, 0, 0]

Solution

public class Solution {
    /**
     * @param temperatures: a list of daily temperatures
     * @return: a list of how many days you would have to wait until a warmer temperature
     */
    public int[] dailyTemperatures(int[] input) {
        // for input[i], return the number of days in the future 
        // that have a higher temperature
        
        int record[] = new int[input.length];
        for (int i = 0; i < record.length; i++) {
            for (int j = i+1; j < record.length; j++) {
                if (input[j] > input[i]) {
                    record[i] = j-i;
                    break;
                }
            }
        }
        
        return record;
    }
}

GPU云服务器云服务器 Temperatures Daily LintCode LintCode134_LRU

文章版权归作者所有，未经允许请勿转载,若此文章存在违规行为，您可以联系管理员删除。

转载请注明本文地址：https://www.ucloud.cn/yun/71519.html

LeetCode 739：每日温度 Daily Temperatures

摘要：提示气温列表长度的范围是。第二次遍历栈顶对应索引的温度索引出栈此时栈为空，。索引入栈，第三次遍历栈顶对应索引的温度满足要求当前索引入栈。每个气温的值的均为华氏度，都是在范围内的整数。题目：根据每日气温列表，请重新生成一个列表，对应位置的输入是你需要再等待多久温度才会升高超过该日的天数。如果之后都不会升高，请在该位置用 0 来代替。例如，给定一个列表 temperatures ...

zhkai 2019-08-19 10:26 评论0 收藏0
[LeetCode] 739. Daily Temperatures

Problem 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 f...

dailybird 2019-08-16 13:54 评论0 收藏0
剑指offer/LintCode12_最小栈

摘要：剑指最小栈声明文章均为本人技术笔记，转载请注明出处解题思路实现功能实现一个最小栈，要求操作均为复杂度，解题思路用栈存储数据用最小栈存储中最小元素，保证栈顶元素与栈顶元素同步，表示此时最小值将与此时最小值比较，将更小的一方压栈，保证中栈顶始终剑指offer/LintCode12_最小栈声明文章均为本人技术笔记，转载请注明出处https://segmentfault.com/u/yz...

Betta 2019-08-14 18:12 评论0 收藏0
剑指offer/LintCode40_用两个栈模拟队列

摘要：剑指用两个栈模拟队列声明文章均为本人技术笔记，转载请注明出处解题思路实现功能用两个栈模拟实现一个队列的，和操作解题思路假设有两个栈队列实现始终用入栈实现队列和实现由于依次出栈并压入中，恰好保证中顺序与模拟队列顺序一致，始终保证栈顶元素为模拟剑指offer/LintCode40_用两个栈模拟队列声明文章均为本人技术笔记，转载请注明出处https://segmentfault.com...

bawn 2019-08-14 18:12 评论0 收藏0
剑指offer/LintCode494_用两个队列实现一个栈

摘要：剑指用两个队列实现一个栈声明文章均为本人技术笔记，转载请注明出处解题思路实现功能用两个队列实现一个栈，实现，，和方法解题思路假设有队列和实现栈的操作实现栈操作始终用来入队实现实现栈的方法模拟栈的过程中，保证两个队列中始终有一个队列为空，另一剑指offer/LintCode494_用两个队列实现一个栈声明文章均为本人技术笔记，转载请注明出处https://segmentfault....

rose 2019-08-14 18:10 评论0 收藏0