Formatted question description: https://leetcode.ca/all/901.html

# 901. Online Stock Span (Medium)

Write a class `StockSpanner`

which 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 backwards) for which the price of the stock 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]`

.

**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:First, S = StockSpanner() is initialized. Then: S.next(100) is called and returns 1, S.next(80) is called and returns 1, S.next(60) is called and returns 1, S.next(70) is called and returns 2, S.next(60) is called and returns 1, S.next(75) is called and returns 4, S.next(85) is called and returns 6. Note that (for example) S.next(75) returned 4, because the last 4 prices (including today's price of 75) were less than or equal to today's price.

**Note:**

- Calls to
`StockSpanner.next(int price)`

will have`1 <= price <= 10^5`

. - There will be at most
`10000`

calls to`StockSpanner.next`

per test case. - There will be at most
`150000`

calls to`StockSpanner.next`

across all test cases. - The total time limit for this problem has been reduced by 75% for C++, and 50% for all other languages.

**Related Topics**:

Stack

## Solution 1.

Consider input `[5,3,1,2,4]`

. When we scan `4`

, we take a look at the previous value `2`

which is smaller than `4`

so we should continue scanning. We don’t need to scan leftwards one by one if we store the index of the previous larger number.

```
index: 0 1 2 3 4
val: 5 3 1 2 4
prev: -1 0 1 1 0
```

So when scanning `4`

, we take a look at `2`

first, and since it’s smaller than `4`

, we can jump to `prev[3] = 1`

. The value at `1`

is `3`

which is again smaller so we continue to jump to `prev[1] = 0`

and we see `5`

which is greater, so we can know that the span is `4 - 0 = 4`

.

```
// OJ: https://leetcode.com/problems/online-stock-span/
// Time: O(1) amortized
// Space: O(N)
class StockSpanner {
vector<int> val = {INT_MAX}, prev = {-1};
public:
StockSpanner() {}
int next(int price) {
int i = val.size() - 1;
while (val[i] <= price) i = prev[i];
val.push_back(price);
prev.push_back(i);
return val.size() - i - 1;
}
};
```

## Solution 1. Monotonic Stack

We don’t need to store those intermediate smaller values since they will be skipped by jumping with the `prev`

values.

```
// OJ: https://leetcode.com/problems/online-stock-span/
// Time: O(1) amortized
// Space: O(N)
class StockSpanner {
stack<pair<int, int>> s; // val, index
int i = 0;
public:
StockSpanner() {
s.emplace(INT_MAX, -1);
}
int next(int price) {
while (s.top().first <= price) s.pop();
int span = i - s.top().second;
s.emplace(price, i++);
return span;
}
};
```