题目描述:
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.
中文描述:给出一个数组代表一个物品每天的价格,且只能买卖一次,问可以赚到的最大利润。
解题思路:这显然是个动态规划的题,最大利润=max(前一天的最大利润,当天价格-前面的最低价格)。
代码(java):
class Solution {
public int maxProfit(int[] prices) {
int minP=Integer.MAX_VALUE;
int maxP=0;
for(int i=0;i<prices.length;i++){
minP=Math.min(minP,prices[i]);
maxP=Math.max(maxP,prices[i]-minP);
}
return maxP;
}
}