买卖股票的最佳时机

class Solution {
public:
    /**
     * @param prices: Given an integer array
     * @return: Maximum profit
     */
    int maxProfit(vector<int> &prices) {
        // write your code here
        if(prices.empty())
return 0 ;
int max = 0; /* 定义最大利润 */
int min = prices[0];
for(int i = 1 ; i < prices.size() ; i++ )
{
if(prices[i] < min)
min = prices[i];
int differ = prices[i] - min ;
if(differ > max)
max = differ;
}
return max;


    }
};

posted @ 2017-03-08 22:21  M橘子小姐  阅读(133)  评论(0编辑  收藏  举报