首页 > 代码库 > Best Time to Buy and Sell Stock
Best Time to Buy and Sell Stock
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 };
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。