题目链接:https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock/
思路:遍历每一天,假设当前天为卖出的那一天,减去在此之前的最小值(包括当前这一天),这样的话每种情况(局部最优解)都考虑到了,取一个最大值即可~~~
上代码:
class Solution {
fun maxProfit(prices: IntArray): Int {
var max = 0
var min = Int.MAX_VALUE
for (price in prices) {
min = Math.min(min, price)
max = Math.max(max, price - min)
}
return max
}
}