题目
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: |
近期评论