成吉思（刷）
Thursday, March 10, 2016
LeetCode Q121: Best Time to Buy and Sell Stock
Say you have an array for which the
i
th
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.
No comments:
Post a Comment
Newer Post
Older Post
Home
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment