Best Time to Buy and Sell Stock

原题地址：点我传送

贪心算法，遍历数列的每两个数的差取最大即可。

C++:

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