LeetCode #122 Best Time to Buy and Sell Stock II 買賣股票最好的時機(二)

public class Solution {
    public int MaxProfit(int[] prices) {
        int res = 0;
        int buy = 0;

        for(int i = 0; i<prices.Length; i++)
        {
            while(i+1<prices.Length && prices[i]>=prices[i+1])
            {
                i++;
            }

            buy = prices[i];

            while(i+1<prices.Length && prices[i]<prices[i+1])
            {
                i++; 
            }

            res += prices[i]-buy;
        }
        return res;
    }
}

public class Solution {
    public int MaxProfit(int[] prices) {
        int res = 0;
        for(int i = 1; i<prices.Length; i++)
        {
            if(prices[i]>prices[i-1])
            {
                res += prices[i]-prices[i-1];
            }
        }
        return res;
    }
}

class Solution {
    public int maxProfit(int[] prices) {
        int res = 0;
        int buy = 0;

        for(int i = 0; i<prices.length; i++)
        {
            while(i+1<prices.length && prices[i]>=prices[i+1])
            {
                i++;
            }

            buy = prices[i];

            while(i+1<prices.length && prices[i]<prices[i+1])
            {
                i++; 
            }

            res += prices[i]-buy;
        }
        return res;
    }
}

class Solution {
    public int maxProfit(int[] prices) {
        int res = 0;
        for(int i = 1; i<prices.length; i++)
        {
            if(prices[i]>prices[i-1])
            {
                res += prices[i]-prices[i-1];
            }
        }
        return res;
    }
}

class Solution:
    def maxProfit(self, prices: List[int]) -> int:
        res = 0
        buy = 0

        i = 0
        while(i<len(prices)):    
        ###for i in range(0,len(prices)):
            while(i+1<len(prices) and prices[i]>=prices[i+1]):
                i+=1
            
            print(i)
            buy = prices[i]

            while(i+1<len(prices) and prices[i]<prices[i+1]):
                i+=1
            
            res += (prices[i]-buy)
            i+=1
        
        return res

class Solution:
    def maxProfit(self, prices: List[int]) -> int:
        res = 0
        for i in range(1,len(prices)):
            if(prices[i]>prices[i-1]):
                res += prices[i]-prices[i-1]
        return res

/**
 * @param {number[]} prices
 * @return {number}
 */
var maxProfit = function(prices) {
    var res = 0;
    var buy = 0;

    for(let i = 0; i<prices.length; i++)
    {
        while(i+1<prices.length && prices[i]>=prices[i+1])
        {
            i++;
        }

        buy = prices[i];

        while(i+1<prices.length && prices[i]<prices[i+1])
        {
            i++; 
        }

        res += prices[i]-buy;
    }
    return res;
};

/**
 * @param {number[]} prices
 * @return {number}
 */
var maxProfit = function(prices) {
    var res = 0;
    for(let i = 1; i<prices.length; i++)
    {
        if(prices[i]>prices[i-1])
        {
            res += prices[i]-prices[i-1];
        }
    }
    return res;
};