LeetCode Solutions/LeetCoding Challenge/November 2021 LeetCoding Challenge/Best Time to Buy and Sell Stock II.java
class Solution {
    public int maxProfit(int[] prices) {
        int profit = 0;
        for(int i=1; i<prices.length; i++){
            if(prices[i] > prices[i-1]){
                profit += prices[i] - prices[i-1];
            }
        }
        return profit;
    }
}