BestTimeToBuyAndSellStockII

cjfan2005 · cjfan2005 · commit ad11ff1cce73 · 2019-08-21T10:06:05.000+08:00
diff --git a/src/kent/alg/leetcode/Array/BestTimeToBuyAndSellStockII.java b/src/kent/alg/leetcode/Array/BestTimeToBuyAndSellStockII.java
@@ -0,0 +1,30 @@
+package kent.alg.leetcode.Array;
+/**
+Say you have an array 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 
+(ie, buy one and sell one share of the stock multiple times). 
+However, you may not engage in multiple transactions at the same time 
+(ie, you must sell the stock before you buy again).
+ */
+public class BestTimeToBuyAndSellStockII {
+	
+	// Time complexity : O(n). Only a single pass is needed.
+	public int maxProfit(int[] prices) {
+		
+		int maxProfit = 0;
+		
+		for(int i=0; i<prices[i]; i++) {
+			if(prices[i]> prices[i-1])
+				maxProfit = prices[i] - prices[i-1];
+		}
+		return maxProfit;
+	}
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+
+	}
+
+}
