LeetCode 初级算法 买卖股票的最佳时机 II

 新手，每天一题。打卡记录，以后能力上来了再优化。仅供参考，大佬勿喷。。。

int maxProfit(int* prices, int pricesSize){
    if(pricesSize <= 1) return 0;
    int i, j, flagin, flagout, buyin, buyout, sum;
    sum = 0;//收益
    buyin = 0;//买入的金额
    buyout = 0;//卖出的金额
    flagin = 0;//买入标志
    flagout = 0;//卖出标志
    for(i = 0; i < pricesSize - 1; i++){ 
        if(prices[i] <= prices[i+1] && flagin == 0){
            flagin = 1;//已经买入，无法继续买入
            buyin = prices[i];
            }
        else if(prices[i] > prices[i+1] && flagin == 1){
            flagin = 0;//已经卖出，可以再次买入了
            flagout = 1;
            buyout = prices[i];
        }
        
        //递增数组，所以卖出为最后一位
        if(i == pricesSize - 2 && flagin == 1){
            buyout = prices[i+1];
            flagout = 1;
        }

        //已经卖出，计算一次收益
        if(flagout == 1){
            sum = (buyout - buyin) + sum;
            buyout = 0;
            buyin = 0;
            flagout = 0;
        }
    }
    return sum;
}