LeetCode-Easy部分中标签为Dynamic Programming 121. Best Time to Buy and Sell Stock

原题

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.

题目分析

Kadane's Algorithm 求两个数的最大差值，后面的数作为被减数，O(n)的时间复杂度，O(1)的空间复杂度。

代码实现

        //7, 1, 5, 3, 6, 4
        public int maxS(int[] nums)
        {
            //i < j
            int maxsofar = 0;
            int maxcur = 0;          
            for (int i = 1; i < nums.Length; i++)
            {
                maxcur += nums[i] - nums[i - 1];
                if(maxcur<0)
                    maxcur = 0;
                maxsofar = Math.Max(maxcur, maxsofar);
            }
            return maxsofar;
        }