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

思考

要求最大利益，即求后面的数与前面的数的最大差。
如例子1：[7, 1, 5, 3, 6, 4]
用min记录当前最小值，用result记录当前最大利益。






最终得到结果为5。

答案

c++

class Solution {
public:
    int maxProfit(vector<int>& prices) {
      int min = INT_MAX;
      int result = 0;
      for (int i = 0; i < prices.size(); i++) {
        if (prices[i] < min)
          min = prices[i];
        else if (prices[i] - min > result)
          result = prices[i] - min;
      }
      return result;
    }
};