aboutsummaryrefslogtreecommitdiff
path: root/online_stock_span.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'online_stock_span.cpp')
-rw-r--r--online_stock_span.cpp20
1 files changed, 19 insertions, 1 deletions
diff --git a/online_stock_span.cpp b/online_stock_span.cpp
index 6d56038..340f32e 100644
--- a/online_stock_span.cpp
+++ b/online_stock_span.cpp
@@ -1,5 +1,17 @@
+// 901. Online Stock Span
#include "leetcode.h"
+/*
+ * 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. if the prices of the stock in the last four
+ * days is '[7,34,1,2]' and the price of the stock today is 8, then the span of
+ * today is 3 because starting from today, the price of the stock was less than
+ * or equal 8 for 3 consecutive days.
+ */
+
class StockSpanner {
public:
stack<pair<int, int>> storage;
@@ -21,5 +33,11 @@ public:
int main() {
StockSpanner *obj = new StockSpanner();
- int param_1 = obj->next(price);
+ printf("%d\n", obj->next(100)); // expect: 1
+ printf("%d\n", obj->next(80)); // expect: 1
+ printf("%d\n", obj->next(60)); // expect: 1
+ printf("%d\n", obj->next(70)); // expect: 2
+ printf("%d\n", obj->next(60)); // expect: 1
+ printf("%d\n", obj->next(75)); // expect: 4
+ printf("%d\n", obj->next(85)); // expect: 6
}