My Java Solution Will Help You


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

Log in to reply
 

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