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(vector<int>& prices) {
int i, len = prices.size();
int states[2] = {0, INT_MAX};
for(i=0; i<len; ++i)
{
states[0] = max(states[0], prices[i] - states[1] ); // profit for one buy, one sell
states[1] = min(states[1], prices[i]); // cost for 1 buy
}
return states[0];
}
};
state[0]: 当前交易一次能获得的最大利润。
state[1]: 当前买入一次所花最少的钱。
则state[0] = max(state[0], prices[i] - states[1] )