LeetCode题组：第121题-买卖股票的最佳时机

int maxProfit(int* prices, int pricesSize){
    //标记最大利润
    int MaxProfit=0;
    int Profit=0;
    for(int i=0; i<pricesSize; i++){
        for(int j=i+1; j<pricesSize ;j++){
            Profit = prices[j]-prices[i];
            if(Profit>MaxProfit) MaxProfit=Profit;
        }
    }
    return MaxProfit;
}

int maxProfit(int* prices, int pricesSize){
    int MaxProfit=0,minprice=10000;
    for(int i=0;i<pricesSize;i++){
            if(minprice>prices[i])
                minprice=prices[i];
            else if(MaxProfit<prices[i]-minprice){
                MaxProfit=prices[i]-minprice;
            }
    }
    return MaxProfit;
}