【leetcode】121. Best Time to Buy and Sell Stock

Difficulty:Easy

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

解题思路（时间复杂度：O(n)）：

对于题目中要求只是找出交易最大一次的值，那么其实只需要遍历一次整个向量，并且将max的值不断更新即可。

可以考虑如下情况：

如果在i位置之前已经有一个min值对应的max收益，那么在i之后如果出现一个prices[i]的值小于min，那么如果需要更新max的值，肯定是在i~n-1之间出现一个值prices[j]-prices[i]>max，所以不需要记录之前的min的位置。经过一次遍历之后，返回max的值就可以得到结果

代码如下：

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