• Leetcode 901. Online Stock Span (单调栈经典题)


    1. Online Stock Span
      Medium
      Design an algorithm that collects daily price quotes for some stock and returns the span of that stock’s price for the current day.

    The span of the stock’s price in one day is the maximum number of consecutive days (starting from that day and going backward) for which the stock price was less than or equal to the price of that day.

    For example, if the prices of the stock in the last four days is [7,2,1,2] and the price of the stock today is 2, then the span of today is 4 because starting from today, the price of the stock was less than or equal 2 for 4 consecutive days.
    Also, if the prices of the stock in the last four days is [7,34,1,2] and the price of the stock today is 8, then the span of today is 3 because starting from today, the price of the stock was less than or equal 8 for 3 consecutive days.
    Implement the StockSpanner class:

    StockSpanner() Initializes the object of the class.
    int next(int price) Returns the span of the stock’s price given that today’s price is price.

    Example 1:

    Input
    [“StockSpanner”, “next”, “next”, “next”, “next”, “next”, “next”, “next”]
    [[], [100], [80], [60], [70], [60], [75], [85]]
    Output
    [null, 1, 1, 1, 2, 1, 4, 6]

    Explanation
    StockSpanner stockSpanner = new StockSpanner();
    stockSpanner.next(100); // return 1
    stockSpanner.next(80); // return 1
    stockSpanner.next(60); // return 1
    stockSpanner.next(70); // return 2
    stockSpanner.next(60); // return 1
    stockSpanner.next(75); // return 4, because the last 4 prices (including today’s price of 75) were less than or equal to today’s price.
    stockSpanner.next(85); // return 6

    Constraints:

    1 <= price <= 105
    At most 104 calls will be made to next.

    解法1:单调栈

    class StockSpanner {
    public:
        StockSpanner() : index(0) {
            
        }
        
        int next(int price) {
            int res = 0;
            while (!stk.empty() && data[stk.top()] <= price) {
                stk.pop();
            }
            if (stk.empty()) res = index + 1;
            else res = index - stk.top();
            data.push_back(price);
            stk.push(index);
            index++;
            return res;
        }
    private:
        vector<int> data;
        stack<int> stk;
        int index;
    };
    
    /**
     * Your StockSpanner object will be instantiated and called as such:
     * StockSpanner* obj = new StockSpanner();
     * int param_1 = obj->next(price);
     */
    
    • 1
    • 2
    • 3
    • 4
    • 5
    • 6
    • 7
    • 8
    • 9
    • 10
    • 11
    • 12
    • 13
    • 14
    • 15
    • 16
    • 17
    • 18
    • 19
    • 20
    • 21
    • 22
    • 23
    • 24
    • 25
    • 26
    • 27
    • 28
    • 29
  • 相关阅读:
    力扣刷题日记
    【C#】WPF获取屏幕分辨率
    如何看待新东方双语主播董宇辉的走红?
    【 盒模型】css盒模型学习
    公积金贷款额度根据什么而定
    LeetCode 101Pro
    吴恩达机器学习课程资源(笔记、中英文字幕视频、课后作业,提供百度云镜像!)
    0079 单链表
    智慧法院解决方案-最新全套文件
    Qt中的基础数据类型
  • 原文地址:https://blog.csdn.net/roufoo/article/details/132945936