Leetcode 题目解析之 Best Time to Buy and Sell Stock

原创

ruochen

发布于 2022-01-08 14:46:06

1.2K0

发布于 2022-01-08 14:46:06

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.

lowest：当前prices最小值
maxProfit：当前profit最大值

    public int maxProfit(int[] prices) {
        if (prices.length <= 1) {
            return 0;
        }
        int maxProfit = 0;
        int lowest = Integer.MAX_VALUE;
        for (int v : prices) {
            lowest = Math.min(v, lowest);
            maxProfit = Math.max(maxProfit, v - lowest);
        }
        return maxProfit;
    }

原创声明：本文系作者授权腾讯云开发者社区发表，未经许可，不得转载。

如有侵权，请联系 cloudcommunity@tencent.com 删除。

algorithm