[leetcode] Best Time to Buy and Sell Stock

最新推荐文章于 2025-09-12 17:31:31 发布

weixin_30793643

最新推荐文章于 2025-09-12 17:31:31 发布

阅读量42

点赞数

CC 4.0 BY-SA版权

文章标签：数据结构与算法 java

原文链接：http://www.cnblogs.com/lasclocker/p/4995519.html

本文介绍了一个使用动态规划解决的最大股票利润问题。通过维护一个变量来实时计算最大收益，该方法确保了在最多完成一次交易的情况下实现最优利润。代码示例展示了如何在给定的股票价格数组中找到最大收益。

题目：

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.

分析：动态规划问题，用一个变量实时保存最大收益，并注意更新查找区域

Java代码：

    public int maxProfit(int[] prices) {
        if(prices == null || prices.length == 0)
            return 0;
        int min = prices[0], max = prices[0];
        int result = 0;
        for (int i = 1; i < prices.length; i++) {
            if (prices[i] > max) { // 实时计算并保存最大收益
                max = prices[i];
                if (max - min > result) {
                    result = max - min;
                }
            } else if (prices[i] < min) { // 重新规定查找区域
                min = prices[i];
                max = prices[i];
            }
        }
        return result;
    }