Another accepted Java solution


  • 7
    public class Solution {
        public int maxProfit(int[] prices) {
            int profit = 0;
            
            for (int i = 1; i < prices.length; i++) 
                profit += Math.max(0, prices[i] - prices[i - 1]);
            
            return profit;
        }
    }

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.