题目一:best-time-to-buy-and-sell-stock
Say you have an array for which the ith element is the price of a given stock on dayi.
If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock),
design an algorithm to find the maximum profit.
代码:
public class Solution {
public int maxProfit(int[] prices) {
if(prices==null ||prices.length <=1)
return 0;
int min=prices[0];
int max=0;
for(int i=0; i<prices.length; i++)
{
min = min<prices[i] ? min : prices[i];
max = max>prices[i]-min ? max : prices[i]-min;
}
return max;
}
}
题目二:best-time-to-buy-and-sell-stock-ii
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 Solution {
public int maxProfit(int[] prices) {
if(prices.length <=1)
return 0;
int sum = 0;
for(int i=1; i<prices.length; i++)
{
if(prices[i]-prices[i-1] > 0)
sum+=prices[i] - prices[i-1];
}
return sum;
}
}
题目三:best-time-to-buy-and-sell-stock-iii
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 at most two transactions.
Note:
You may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).
public class Solution {
public int maxProfit(int[] prices) {
if (prices.length < 2) return 0;
int n = prices.length;
int[] preProfit = new int[n];
int[] postProfit = new int[n];
int curMin = prices[0];
for (int i = 1; i < n; i++) {
curMin = Math.min(curMin, prices[i]);
//preProfit[i - 1]与后文postProfit[i + 1]避免了在i点撞车
preProfit[i] = Math.max(preProfit[i - 1], prices[i] - curMin);
}
int curMax = prices[n - 1];
for (int i = n - 2; i >= 0; i--) {
curMax = Math.max(curMax, prices[i]);
postProfit[i] = Math.max(postProfit[i + 1], curMax - prices[i]);
}
int maxProfit = 0;
for (int i = 0; i < n; i++) {
maxProfit = Math.max(maxProfit, preProfit[i] + postProfit[i]);
}
return maxProfit;
}
}