题目
解法:暴力解法(tle)
这道题的关键当然是在于找min和max,很自然的想到了用heap。但是没太想明白怎么同时保持这两个heap
class StockPrice:
def __init__(self):
self.time2price = {
}
self.curr_price = None
self.curr_time = None
self.min_price = 1000000000
self.max_price = 0
def update(self, timestamp: int, price: int) -> None:
if self.curr_time == None:
self.curr_time = timestamp
self.curr_price = price
else:
if timestamp >= self.curr_time:
self.curr_time = timestamp
self.curr_price = price
# if self.min_price == None:
# self.min_price = price
# self.max_price = price
# self.time2price[timestamp] = price
# return
if timestamp not in self.time2price:
self