zoukankan      html  css  js  c++  java
  • 901. Online Stock Span

    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:

    1. Calls to StockSpanner.next(int price) will have 1 <= price <= 10^5.
    2. There will be at most 10000 calls to StockSpanner.next per test case.
    3. There will be at most 150000 calls to StockSpanner.next across all test cases.
    4. The total time limit for this problem has been reduced by 75% for C++, and 50% for all other languages.
    class StockSpanner {
        List<Integer> list;
        public StockSpanner() {
            list = new ArrayList();
        }
        
        public int next(int price) {
            list.add(price);
            int le = list.size();
            int res = 0;
            for(int i = le-1; i >= 0; i--){
                if(list.get(i) <= price) res++;
                else return res;
            }
            return res;
        }
    }
    
    /**
     * Your StockSpanner object will be instantiated and called as such:
     * StockSpanner obj = new StockSpanner();
     * int param_1 = obj.next(price);
     */

    首先brute force,奥里给

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

    stack包含了当前的price和span,压入之前while循环看前面有多少个小的。

    class StockSpanner {
        Stack<Integer> prices, weights;
    
        public StockSpanner() {
            prices = new Stack();
            weights = new Stack();
        }
    
        public int next(int price) {
            int w = 1;
            while (!prices.isEmpty() && prices.peek() <= price) {
                prices.pop();
                w += weights.pop();
            }
    
            prices.push(price);
            weights.push(w);
            return w;
        }
    }

    这个和上面的其实一样,但没有上面的直观

  • 相关阅读:
    【史上最全】DDoS防御产品服务合集
    DDoS攻击与防御的心得体会
    防范DDoS攻击的15个方法
    什么是DDoS攻击?
    蜜罐技术详解
    全年DDoS攻击分析|知道创宇云安全2018年度网络安全态势报告
    抗D十招:十个方法完美解决DDoS攻击防御难题
    DDOS 攻击的防范教程--转载自阮一峰的博客
    手把手教你查看网站遭受到的Web应用攻击类型
    mlbox ImportError: Cannot load backend 'TkAgg' which requires the 'tk' interactive framework, as 'headless' is currently running
  • 原文地址:https://www.cnblogs.com/wentiliangkaihua/p/12920549.html
Copyright © 2011-2022 走看看