Best Time to Buy and Sell Stock II.java

/*
    Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to 
    find the maximum profit. You may complete as many transactions as you like (ie, buy one and sell one share of 
    the stock multiple times). However, you may not engage in multiple transactions at the same time (ie, you must 
    sell the stock before you buy again).
    
    Link: https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/

    Example: None

    Solution: None
    
    Source: None
*/

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