g0901_1000.s0901_online_stock_span.StockSpanner Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java21 Show documentation

Java-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.38

package g0901_1000.s0901_online_stock_span;

// #Medium #Stack #Design #Monotonic_Stack #Data_Stream
// #2022_03_28_Time_47_ms_(76.17%)_Space_88.8_MB_(5.16%)

import java.util.Deque;
import java.util.HashMap;
import java.util.LinkedList;
import java.util.Map;

/**
 * 901 - 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 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`.
 *
 * **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 <= 10⁵
 * *   At most 10⁴ calls will be made to `next`.
**/
public class StockSpanner {
    private final Map map;
    private final Deque stocks;
    private int index;

    public StockSpanner() {
        stocks = new LinkedList<>();
        index = -1;
        map = new HashMap<>();
        stocks.push(-1);
    }

    public int next(int price) {
        if (index != -1) {
            stocks.push(index);
        }
        map.put(++index, price);
        if (stocks.size() == 1) {
            return (index - stocks.peek());
        }
        while (stocks.size() > 1 && map.get(stocks.peek()) <= price) {
            stocks.pop();
        }
        return (index - stocks.peek());
    }
}

/*
 * Your StockSpanner object will be instantiated and called as such:
 * StockSpanner obj = new StockSpanner();
 * int param_1 = obj.next(price);
 */