LeetCode刷题【Array】 Best Time to Buy and Sell Stock

本文探讨了给定股票价格数组情况下如何通过一次交易获得最大利润的问题,并提供了三种不同的算法实现方式,包括暴力求解、一次遍历及使用Kadane's Algorithm算法。

摘要生成于 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.

解决方法一:  对于比较极端的案例,会Time Limit Exceeded,后面考虑优化;

public class Solution {
    public int maxProfit(int[] prices) {
        if(prices==null) return 0;
        int profit=0;
        int l[] = new int[prices.length];
        for(int i=0;i<prices.length;i++){
            for(int j=i;j>=0;j--){
                l[j]= (prices[i]-prices[j])>l[j] ? (prices[i]-prices[j]):l[j];
                if(l[j]>profit)
                    profit=l[j];
            }
        }
        return profit;
    }
}


解决方法二Runtime:  2 ms

public class Solution {
    public int maxProfit(int[] prices) {
        if(prices==null) return 0;
        int profit=0;
        int minbuy=2147483647;
        for(int i=0;i<prices.length;i++){
            minbuy=prices[i]<minbuy ? prices[i]:minbuy;
            profit=(prices[i]-minbuy)>profit ? (prices[i]-minbuy):profit;
        }
        return profit;
    }
}

解决方法三:Kadane's Algorithm 算法, Runtime:  4 ms

public 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;
    }
}

参考:

【1】https://leetcode.com/

【2】https://en.wikipedia.org/wiki/Maximum_subarray_problem

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值