Description:
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 = 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.
题意:一个一维数组里面的元素xi表示第i天股票的价格,我们可以选择买进或卖出,如果最多只允许进行一个买入和一次卖出(并且需要先买入才能够进行卖出),求可获得的最大收益;
解法一:最简单解法就是暴力求解了,遍历所有可能的结果,题目要求必须先买进才可以卖出,所以卖出的天数肯定在买进的天数后面,因此我们可以对买进天数i(i在[0, length-2]的范围内),假设在其后每一天卖出产生的收益来比较最后可以得到的最大收益;
class Solution {
public int maxProfit(int[] prices) {
int maxProfit = 0;
for(int i = 0; i < prices.length - 1; i++) {
for(int j = i + 1; j < prices.length; j++) {
maxProfit = prices[j] - prices[i] > maxProfit ? prices[j] - prices[i] : maxProfit ;
}
}
return maxProfit;
}
}
解法二:参考Kadane’s algorithm,用于求一维数组连续子序列的最大和;算法的思想是假设此时的最大和为Sum,如果加上下一个元素x后其值小于零,那么此时我们就另Sum为当前元素x了,因为再累加已经没有意义了;对于这道题目来说,我们将一维数组的点描绘在二维坐标系上,其实就是求解这条曲线山峰和山谷的最大差值;假设当前最大和为currentMaxProfit,如果加上下一个两元素之间的差值后小于零,就没有必要再进行累加了,另当前最大和为0,同时,我们需要有一个全局最大值maxProfit来保存每个时刻比较后得到的最大值;
class Solution {
public int maxProfit(int[] prices) {
int maxProfit = 0;
int currentMaxProfit = 0;
for(int i=1; i<prices.length; i++) {
currentMaxProfit = Math.max(0, currentMaxProfit + prices[i] - prices[i-1]);
maxProfit = currentMaxProfit > maxProfit ? currentMaxProfit : maxProfit;
}
return maxProfit;
}
}