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

翻译

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.

程序

程序1

//程序效率太低
//Brute Force
//时间复杂度O(n^2)
int maxProfit(int* prices, int pricesSize){
    int maxProfit = 0;
    for(int i = 0;i<pricesSize;++i)
    {
        for(int j=i+1;j<pricesSize;++j)
        {
        	//比较了所有符合条件的收益 
            if(prices[j]-prices[i]>maxProfit)
                maxProfit=prices[j]-prices[i];
        }
    }
    return maxProfit;
}

程序二

int min(int a, int b)
{
  return (a<b)?a:b;
}

int max(int a, int b)
{
  return (a>b)?a:b;
}

//Dynamic-Programming
//时间复杂度O(n)
int maxProfit(int* prices, int pricesSize)
{
  int profit=0, lowBuy = prices[0];

  for(int i = 1; i<pricesSize; )  
  {
  	//判断当前收益是否高于之前最高收益
    profit = max(profit, prices[i] - lowBuy);
    //判断当前的价格与最低买入价哪个更低
    //永远是在判断在i之前的最低价   实现了题目中只能在买入后卖出的要求
    lowBuy = min(lowBuy,prices[i++]) ;
  }
  return profit;
}

参考程序

总结

1. DP不够熟练 并不理解动态规划是什么 有什么特征
   动态规划就是通过解决子问题解决问题的方法
2. 第二个程序可以理解成
   在i的循环中，通过找每个i之前的最高收益（解决子问题），来找所有价格中的 最高收益（解决了问题）