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 (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.

Example 1:

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.

Example 2:

Input: [7,6,4,3,1] Output: 0 Explanation: In this case, no transaction
is done, i.e. max profit = 0.

思路很简单：
记录当前位置i，然后往下循环，如果比这个数大，就求差然后与最大差值比较，如果比i小就更新i。

#!/usr/bin/env python3
# -*- coding: utf-8 -*-

' a test module '

__author__ = 'Zhang Shuai'

class Solution:
    def maxProfit(self, prices):
        """
        :type prices: List[int]
        :rtype: int
        """
        i = 0
        res = 0
        for j in range(len(prices)):
            if prices[j] > prices[i]:
                res = max(res, prices[j] - prices[i])
            else:
                i = j
        return res

下面利用到求连续最大和。
参考：https://blog.csdn.net/u012501459/article/details/46500909
方法1：
我们计算没两天之间的差值，然后就可以通过求连续最大和的方法计算了。
初始状态A[i]可以定义为第i天卖出可以挣的最多的钱。设数组prices=[2,3,1,4,5,3,6]，从第0天开始算起

可以先将上面数组相邻两项之间的差值计算出来，subPrices=[1,-2,3,1,-2,3]

A[1]表示第1天卖出可以挣的最多钱，A[1]=1
A[2]表示第2天卖出可以挣的最多钱，A[2]=A[1]+(-2)=-1
A[3]表示第3天卖出可以挣的最多钱，A[3]=3
A[4]表示第4天卖出可以挣的最多钱，A[4]=A[3]+1=4
A[5]表示第5天卖出可以挣的最多钱，A[5]=A[4]+(-2)

…..

那么状态转移方程：
A[i]=max{A[i-1],0}+subPrices[i]
问题的解就是max{A[i]}

class Solution2:
    def maxProfit(self, prices):
        """
        :type prices: List[int]
        :rtype: int
        """
        #边求差边求cum，只遍历一遍。
        lenth = len(prices)
        if not prices or lenth ==0 or lenth==1:
            return 0
        cum = max(prices[1]-prices[0],0)
        maxresult = cum
        for i in range(2,lenth):
            cum = max(cum,0) + prices[i] - prices[i-1]
            maxresult = max(maxresult,cum)
        return maxresult