标签：des style blog color os io for ar
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.empty() ) { return 0; } 5 int curMin = prices[0], profit = 0; 6 for( size_t i = 1; i!= prices.size(); ++i ) { 7 if( curMin > prices[i] ) { curMin = prices[i]; continue; } 8 if( profit < prices[i]-curMin ) { profit = prices[i]-curMin; } 9 } 10 return profit; 11 } 12 };
Best Time to Buy and Sell Stock,布布扣,bubuko.com
Best Time to Buy and Sell Stock
标签：des style blog color os io for ar
原文地址：http://www.cnblogs.com/moderate-fish/p/3913251.html
