121. Best Time to Buy and Sell Stock

Say you have an array for which the i^th 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.
///n^2肯定是不行的2333333333333333333333
///好蠢啊

 1 class Solution {
 2 public:
 3     int maxProfit(vector<int>& prices) {
 4         int n=prices.size();
 5         int ans=0;
 6         int min=0;
 7         for(int i=1;i<n;i++){
 8             if(prices[i]-prices[min]>ans)
 9                 ans=prices[i]-prices[min];
10             if(prices[i]<prices[min])
11                 min=i;
12         }
13         return ans;
14     }
15 };