-
Notifications
You must be signed in to change notification settings - Fork 17
/
MaxProfiFromStock.cpp
34 lines (23 loc) · 1.13 KB
/
MaxProfiFromStock.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
Best Time to Buy and Sell Stock : Imp interview question
Say you have an array prices for which the ith element is the price of a given stock on day i.
Design an algorithm to find the maximum profit. You may complete as many transactions as you like (i.e., buy one and sell one share of the stock multiple times).
Note: You may not engage in multiple transactions at the same time (i.e., you must sell the stock before you buy again).
Example 1:
Input: [7,1,5,3,6,4]
Output: 7
Explanation: Buy on day 2 (price = 1) and sell on day 3 (price = 5), profit = 5-1 = 4.
Then buy on day 4 (price = 3) and sell on day 5 (price = 6), profit = 6-3 = 3.
Question Link- https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/
CODE:
int maxProfit(vector<int>& prices) {
//we want to buy only if price[i] < price[i+1]
//profit= price[i+1] - price[i]
int profit= 0;
for(int i=0; i<prices.size()-1; ++i){
if(prices[i] < prices[i+1]){
profit= profit + (prices[i+1]-prices[i]);
}
}
return profit;
}
Complexity: O(n), Linear time complexity