[Leetcode] Best Time to Buy and Sell Stock

标签：des   io   os   ar   for   sp   on   cti   bs   

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.

Solution:

[Leetcode] Best Time to Buy and Sell Stock

标签：des   io   os   ar   for   sp   on   cti   bs   

原文地址：http://www.cnblogs.com/Phoebe815/p/4027914.html