Online Stock Span

IF
AlgoAxiomStaff Engineers
JSTS
Medium20 mins

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.

Implement the StockSpanner class:

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

Examples

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

stockSpanner.next(85); // return 6

`

Constraints

  • 1 <= price <= 10^5
  • At most 5000 calls will be made to next
Source: Stacks pattern — AlgoAxiom
JavaScript
Test Case 1
root = [1, 2, 3]
Test Case 2
root = [1, 2, 3, 4, 5]
Idle