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 today is defined as the maximum number of consecutive days (starting from today and going backward) for which the stock price was less than or equal to today's price.


	For example, if the price of a stock over the next 7 days were [100,80,60,70,60,75,85], then the stock spans would be [1,1,1,2,1,4,6].


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.


&nbsp;
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


&nbsp;
Constraints:


	1 &lt;= price &lt;= 105
	At most 104 calls will be made to next.


class StockSpanner:

    def __init__(self):
        self.stack = []
        
    def next(self, price: int) -> int:
        
        ans = 1
        while self.stack and self.stack[-1][0] <= price:
            ans += self.stack.pop()[1]
        
        self.stack.append((price, ans))
        
        return ans
        

# Your StockSpanner object will be instantiated and called as such:
# obj = StockSpanner()
# param_1 = obj.next(price)
class Pair{
    int stock;
    int span;
    
    public Pair(int stock, int span){
        this.stock = stock;
        this.span = span;
    }
    
}
class StockSpanner {
    Stack<Pair> stack;
    public StockSpanner() {
        stack = new Stack<>();
    }
    
    public int next(int price) {
        int span = 1;
        while(!stack.isEmpty() && stack.peek().stock <= price){
           Pair pStock = stack.pop();
           span += pStock.span ;
        }
        stack.push(new Pair(price, span));
        return span;
    }
}

/**
 * Your StockSpanner object will be instantiated and called as such:
 * StockSpanner obj = new StockSpanner();
 * int param_1 = obj.next(price);
 */
class StockSpanner {
public:
    stack<pair<int , int>>s; //val , index
    vector<int>prices;
    vector<int>res;
    StockSpanner() {

    }

    int next(int price) {
        prices.push_back(price);
        int n = prices.size();
        for(int i = n-1 ; i<n ; i++)
        {
            while(!s.empty() and s.top().first <= prices[i])
            {
                s.pop();
            }
            if(s.empty())
            {
                res.push_back(i - 0 + 1);
                s.push({prices[i] , i});
            }
            else
            {
                auto it = s.top();
                res.push_back({i - it.second });
                s.push({prices[i] , i});
            }
        }
        return res[n-1];
    }
};
var StockSpanner = function() {
    this.stack = [];
    this.idx = 0;
};

StockSpanner.prototype.next = function(price) {
    
	// keep Pop-ing if top element of stack is bigger than current price
    while(this.stack.length > 0 && this.stack[this.stack.length-1][0] <= price){
        this.stack.pop();
    }
    
	// if stack is empty after above operation
    if(this.stack.length === 0){
	
		// Push current price with index
        this.stack.push([price,this.idx]);
		
		// increment index - this is a tricky part
        this.idx++;
		
        return this.idx;
    }
    
	// caclulate distance from top element of stack and return
	
    const res = this.idx - this.stack[this.stack.length-1][1];
    this.stack.push([price,this.idx]);
    this.idx++;
    return res;
};
Online Stock Span