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.
一次交易，找到最小值和最大值，注意最大值得在最小值后面。
1 class Solution { 2 public: 3 int maxProfit(vector<int>& prices) { 4 if(prices.size()<2) return 0; 5 int result = 0; 6 int cur_min= prices[0]; 7 for(int i=1;i<prices.size();i++) 8 { 9 result = max(result,prices[i]-cur_min); 10 cur_min = min(cur_min,prices[i]); 11 } 12 return result; 13 } 14 };
[LeetCode]Best Time to Buy and Sell Stock
原文：http://www.cnblogs.com/Sean-le/p/4781565.html