Simple 5-line Solution


  • 2
    A
      public int maxProfit(int[] prices) {
            if (prices.length < 2) return 0;
            int max = 0;
            for (int i = 1; i < prices.length; i++) 
                max += Math.max(0, 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.