原题
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 (ie, buy one and sell one share of the stock), design an algorithm to find the maximum profit.
Example 1:
Input: [7, 1, 5, 3, 6, 4]
Output: 5
max. difference = 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
In this case, no transaction is done, i.e. max profit = 0.
代码实现
public int MaxProfit(int[] prices) {
int premax = 0;
int curmax = 0;
for(int i=1; i<prices.Length; i++)
{
int cal = prices[i]-prices[i-1]; //相邻项差值
curmax = Math.Max(cal,cal+curmax); //参考当前项后的最大值
premax = Math.Max(curmax,premax); //赚钱最大值
}
return premax;
}
此题与 Maximum Subarray
有异曲同工之妙
leetcode-solution库
leetcode算法题目解决方案每天更新在github库中,欢迎感兴趣的朋友加入进来,也欢迎star,或pull request。https://github.com/jackzhenguo/leetcode-csharp