2023每日刷題（五十二）

Leetcode—2034.股票價格波動

算法思想

實現代碼

class StockPrice {
public:int last = 0;multiset<int> total;unordered_map<int, int> m;StockPrice() {}void update(int timestamp, int price) {if(m.count(timestamp)) {total.erase(total.find(m[timestamp]));}m[timestamp] = price;total.insert(price);last = max(last, timestamp);}int current() {return m[last];}int maximum() {return *total.rbegin();}int minimum() {return *total.begin();}
};/*** Your StockPrice object will be instantiated and called as such:* StockPrice* obj = new StockPrice();* obj->update(timestamp,price);* int param_2 = obj->current();* int param_3 = obj->maximum();* int param_4 = obj->minimum();*/

運行結果

之后我會持續更新，如果喜歡我的文章，請記得一鍵三連哦，點贊關注收藏，你的每一個贊每一份關注每一次收藏都將是我前進路上的無限動力 ！！！↖(▔▽▔)↗感謝支持！