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.
class Solution {
public int maxProfit(int[] prices) {
int length = prices.length;
int temp = 0, maxprice = 0;
int max=-1;
int min =65535;
int maxx[] =new int[length];
if(length<=1)
return 0;
maxx[length-1]=prices[length-1];
for (int i = length-2; i >=0; i--){
if(prices[i]>maxx[i+1])
maxx[i]=prices[i];
else
maxx[i]=maxx[i+1];
}
for (int i = 0; i < length; i++) {
if(prices[i]<min)
min=prices[i];
if(maxx[i]-min>maxprice)
maxprice = maxx[i]-min;
}
return maxprice;
}
}
思路:先逆序求出自最后一个到当前第i个位置的最大值,再正序求出第i个的最小值,同时计算第i个位置的逆序最大值与正序最小值之差。