Say you have an array for which the ith element is the price of a given stock on day i.
If you were only permitted to complete at most one transaction (i.e., buy one and sell one share of the stock), design an algorithm to find the maximum profit.
Note that you cannot sell a stock before you buy one.
Example 1:
Input: [7,1,5,3,6,4]
Output: 5
Explanation: Buy on day 2 (price = 1) and sell on day 5 (price = 6), profit = 6-1 = 5.
Not 7-1 = 6, as selling price needs to be larger than buying price.
Example 2:
Input: [7,6,4,3,1]
Output: 0
Explanation: In this case, no transaction is done, i.e. max profit = 0.
method 1 greedy
用一个变量记录最低价格,遍历时求最大利润
public int maxProfit(int[] prices) {
int maxProfit = 0;
int minPrice = Integer.MAX_VALUE;
for (int i = 0; i < prices.length; i++) {
minPrice = Math.min(minPrice,prices[i]);
maxProfit = Math.max(maxProfit,prices[i] - minPrice);
}
return maxProfit;
}
method 2 dp
一定程度上,所有贪心算法都可以转化为动态规划问题,这里可以以dp[i]作为以i为止目前最低价格数,然后遍历时求最大利润
代码略
summary
- 这里dp记录的并不是直接的结果,而是序列中的某个属性,比如最小值。