标签：white rmi toc body int footer com imu str
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.
Given array [3,2,3,1,2], return 1.
[LintCode] Best Time to Buy and Sell Stock 买卖股票的最佳时间
标签：white rmi toc body int footer com imu str
原文地址：http://www.cnblogs.com/grandyang/p/6130003.html
