https://leetcode-cn.com/problems/gu-piao-de-zui-da-li-run-lcof/
思路一:贪心,因为只能买卖一次,所以只要知道 [ 1 … i ] [1…i] [1…i]的最小值 M i n i Min_i Mini和 [ i … n ] [i…n] [i…n]的最大值 M a x i Max_i Maxi,就可以更新 a n s = m a x ( a
https://leetcode-cn.com/problems/gu-piao-de-zui-da-li-run-lcof/
思路一:贪心,因为只能买卖一次,所以只要知道 [ 1 … i ] [1…i] [1…i]的最小值 M i n i Min_i Mini和 [ i … n ] [i…n] [i…n]的最大值 M a x i Max_i Maxi,就可以更新 a n s = m a x ( a