public class Solution {
public int maxProfit(int[] prices) {
if(prices.length == 0)
return 0;
int min_price = prices[0];
int max_profit = 0;
for(int i = 0;i< prices.length;i++)
{
if(prices[i] < min_price)
min_price = prices[i];
if(prices[i]-min_price > max_profit)
max_profit = prices[i] - min_price;
}
return max_profit;
}
}
//就是扫了一遍,确定当前最小的,然后比较就可以了。
leetcode java Best Time to Buy and Sell Stock
最新推荐文章于 2022-07-03 21:43:22 发布