No.289 - LeetCode[901] Online Stock Span - 单调栈

单调栈模拟就行。

/*
 * @lc app=leetcode id=901 lang=cpp
 *
 * [901] Online Stock Span
 */

// @lc code=start
class StockSpanner {
public:
    stack<pair<int,int>> s;
    int cnt;
    StockSpanner() {
        cnt = 0;
    }
    
    int next(int price) {
        cnt++;
        int desc = 0;
        while(!s.empty() && s.top().first <= price) s.pop();
        if(!s.empty()) {
            desc = s.top().second;
        }
        s.push(make_pair(price, cnt));
        return cnt - desc;
    }
};

/**
 * Your StockSpanner object will be instantiated and called as such:
 * StockSpanner* obj = new StockSpanner();
 * int param_1 = obj->next(price);
 */
// @lc code=end