-
Notifications
You must be signed in to change notification settings - Fork 2
/
BuyAndSellStockII.java
54 lines (51 loc) · 1.68 KB
/
BuyAndSellStockII.java
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
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
package Leetcode;
/**
* @author kalpak
*
* You are given an array prices for which the ith element is the price of a given stock on day i.
* Find the maximum profit you can achieve. 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 simultaneously (i.e., you must sell the stock before you buy again).
*
*
*
* Example 1:
* Input: prices = [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.
*
* Example 2:
* Input: prices = [1,2,3,4,5]
* Output: 4
* Explanation: Buy on day 1 (price = 1) and sell on day 5 (price = 5), profit = 5-1 = 4.
* Note that you cannot buy on day 1, buy on day 2 and sell them later, as you are engaging multiple transactions at the same time.
* You must sell before buying again.
*
* Example 3:
* Input: prices = [7,6,4,3,1]
* Output: 0
* Explanation: In this case, no transaction is done, i.e., max profit = 0.
*
*
* Constraints:
*
* 1 <= prices.length <= 3 * 10^4
* 0 <= prices[i] <= 10^4
*
*/
public class BuyAndSellStockII {
public static int maxProfit(int[] prices) {
int result = 0;
for(int i = 1; i < prices.length; i++) {
if(prices[i] > prices[i - 1])
result += prices[i] - prices[i - 1];
}
return result;
}
public static void main(String[] args) {
System.out.println("The maximum profit obtained after doing multiple transactions are : " +
maxProfit(new int[]{7, 1, 5, 3, 6, 4}));
}
}