题目描述
题目难度:Easy
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.
AC代码1
max数组第i位保存的是从第i开始到数组的最后这之间最大的价格。
class Solution {
public int maxProfit(int[] prices) {
if(prices == null || prices.length == 0) return 0;
int res = 0;
int[] max = new int[prices.length];
max[prices.length - 1] = prices[prices.length - 1];
for(int i = prices.length - 2;i >= 0;i--){
if(prices[i] > max[i + 1]) max[i] = prices[i];
else max[i] = max[i + 1];
}
for(int i = 0;i < prices.length;i++){
if(max[i] - prices[i] > res) res = max[i] - prices[i];
}
return res;
}
}
AC代码2
public class Solution {
public int maxProfit(int[] prices) {
if(prices.length == 0)
return 0;
int maxPro = 0;
int mix = prices[0];
for(int i : prices){
maxPro = (maxPro >= i - mix) ? maxPro : (i - mix);
mix = (mix <= i) ? mix : i;
}
return maxPro;
}
}