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)

Input: [7, 6, 4, 3, 1]
Output: 0

In this case, no transaction is done, i.e. max profit = 0.

• 题目非常好理解，买入股票然后卖出，求一次交易的最大收益
• 我们可以用两个循环嵌套，依次比较每次可能交易的收益，最后得出最大收益

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int n;
        n = prices.size();
        int maxpro = 0,pro;
        for(int j = 0;j<n;j++) {
          for(int i = j+1;i<n;i++) {
            if(prices[i]>prices[j]){
                pro = prices[i]-prices[j];
                maxpro = max(pro,maxpro);
            }
          }
        }
        return maxpro;
    }
};