Best Time to Buy and Sell Stock

最新推荐文章于 2022-07-29 20:36:59 发布

dihu6677

最新推荐文章于 2022-07-29 20:36:59 发布

阅读量115

点赞数

原文链接：http://www.cnblogs.com/GodBug/p/7425639.html

版权

本文介绍了一种算法，用于计算给定股票价格数组中能够获得的最大利润，仅允许进行一次买入和卖出操作。通过示例展示了算法的正确性和效率，对比了两种不同的实现方式。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

Example 1:

Input: [7, 1, 5, 3, 6, 4]
Output: 5

max. difference = 6-1 = 5 (not 7-1 = 6, as selling price needs to be larger than buying price)

Example 2:

Input: [7, 6, 4, 3, 1]
Output: 0

In this case, no transaction is done, i.e. max profit = 0.

class Solution {
    public int maxProfit(int[] prices) {
        int maxCur = 0, maxSoFar = 0;
        for(int i = 1; i < prices.length; i++) {
            maxCur = Math.max(0, maxCur += prices[i] - prices[i-1]);
            maxSoFar = Math.max(maxCur, maxSoFar);
        }
        return maxSoFar;
    }    
    // 此方法超时
    public int maxProfit1(int[] prices) {
        int maxPrice = 0;
        for(int i=0;i<prices.length;i++){
            for(int j=i;j<prices.length;j++){
                if(prices[j]-prices[i]>0){
                    maxPrice = Math.max(prices[j]-prices[i],maxPrice);    
                }
            }
        }
        return maxPrice;
    }
}

转载于:https://www.cnblogs.com/GodBug/p/7425639.html