C#LeetCode刷题之#121-买卖股票的最佳时机(Best Time to Buy and Sell Stock)

C#LeetCode刷题之#121-买卖股票的最佳时机(Best Time to Buy and Sell Stock)

问题

给定一个数组,它的第 i 个元素是一支给定股票第 i 天的价格。

如果你最多只允许完成一笔交易(即买入和卖出一支股票),设计一个算法来计算你所能获取的最大利润。

注意你不能在买入股票前卖出股票。

输入: [7,1,5,3,6,4]

输出: 5

解释: 在第 2 天(股票价格 = 1)的时候买入,在第 5 天(股票价格 = 6)的时候卖出,最大利润 = 6-1 = 5 。注意利润不能是 7-1 = 6, 因为卖出价格需要大于买入价格。

输入: [7,6,4,3,1]

输出: 0

解释: 在这种情况下, 没有交易完成, 所以最大利润为 0。

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 (i.e., buy one and sell one share of the stock), design an algorithm to find the maximum profit.

Note that you cannot sell a stock before you buy one.

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

Output: 5

Explanation: Buy on day 2 (price = 1) and sell on day 5 (price = 6), profit = 6-1 = 5.Not 7-1 = 6, as selling price needs to be larger than buying price.

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

Output: 0

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

示例

public class Program {

    public static void Main(string[] args) {
        int[] prices = { 7, 1, 5, 3, 6, 4 };

        var res = MaxProfit(prices);
        Console.WriteLine(res);

        Console.ReadKey();
    }

    private static int MaxProfit(int[] prices) {
        int result = 0;
        if(prices == null || prices.Length == 0)
            return 0;
        int min = prices[0];
        for(int i = 1; i < prices.Length; i++) {
            //动态规划
            result = Math.Max(result, prices[i] - min);
            min = Math.Min(min, prices[i]);
        }
        return result;
    }

}

以上给出1种算法实现,以下是这个案例的输出结果:

5

分析:

在最坏的情况下,以上算法的时间复杂度为: O(n) 。

本文由 .Net中文网 原创发布,欢迎大家踊跃转载。

转载请注明本文地址:https://www.byteflying.com/archives/4014

发表评论

登录后才能评论