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
7days 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 isprice.
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 <= 105- At most
104calls will be made tonext.
type StockSpanner struct {
stack []int
count []int
}
func Constructor() StockSpanner {
return StockSpanner{ stack: []int{}, count: []int{} }
}
func (this *StockSpanner) Next(price int) int {
if len(this.stack) == 0{
this.count = append(this.count, 1)
} else {
index := len(this.stack) - 1
put := 1
for index >= 0 {
if this.stack[index] <= price {
put++
} else if this.stack[index] > price {
break
}
index--
}
this.count = append(this.count, put)
}
this.stack = append(this.stack, price)
return this.count[len(this.count)-1]
}
/**
* Your StockSpanner object will be instantiated and called as such:
* obj := Constructor();
* param_1 := obj.Next(price);
*/
Last modified 6mo ago