739. Daily Temperatures

2024-04-30 09:51:00

为什么80%的码农都做不了架构师？>>>

Description

Tag：Stack, Hash Table
Difficulty: Medium

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

从后向前，将大值压入栈中，在压栈过程中，将小值pop出去，然后依次查找即可。

type ele struct {index inttemperature int
}
var stack []ele
var top = -1
func dailyTemperatures(T []int) []int {size := len(T)stack = make([]ele, size)result := make([]int, size)for i:= size -1; i>=0;i-- {result[i] = find(T[i], i)push(T[i], i)}return result
}func find(t int, index int) int {for i:=top; i>=0; i-- {if stack[i].temperature > t {return stack[i].index - index}}return 0
}func push(t int, i int) {for top >=0 && stack[top].temperature <= t {top--}top++element := ele{i, t}stack[top] = element
}

转载于:https://my.oschina.net/liufq/blog/2961411

739. Daily Temperatures相关推荐

739. Daily Temperatures - LeetCode
Question 739. Daily Temperatures Solution 题目大意:比今天温度还要高还需要几天思路:笨方法实现,每次遍历未来几天,比今天温度高,就坐标减 Java实现: p ...
LeetCode #739 - Daily Temperatures
题目描述: Given a list of daily temperatures T, return a list such that, for each day in the input, tell ...
69.Daily Temperatures（日常气温）
Level: Medium 题目描述: Given a list of daily temperatures T, return a list such that, for each day in ...
LeetCode739. Daily Temperatures
题目: Given a list of daily temperatures, produce a list that, for each day in the input, tells you ho ...
单调队列 Monotonic Queue / 单调栈 Monotonic Stack
2018-11-16 22:45:48 一.单调队列 Monotone Queue 239. Sliding Window Maximum 问题描述: 问题求解: 本题是一个经典的可以使用双端队列或者 ...
leetcode刷题规划
LeetCode精华题目列表[刷题规划系列] – TuringPlanet 目录算法题到底在考察什么? 题目列表 Array String Linked List Queue Stack Advan ...
LeetCode刷题之python解法（持续更新）
1. Two Sum 4行 class Solution:def twoSum(self, nums: List[int], target: int) -> List[int]:d = {}fo ...
Leetcode算法题-解法转载
版权声明:本文为博主原创文章,未经博主允许不得转载. https://blog.csdn.net/fuxuemingzhu/article/details/85112591 作者: 负雪明烛 i ...
Leetcode题解(超赞!!!)
我是技术搬运工,好东西当然要和大家分享啦.原文地址算法思想二分查找二分查找思想简单,但是在实现时有一些需要注意的细节: 在计算 mid 时不能使用 mid = (l + h) / 2 这种方式, ...

最新文章

热门文章