A concise solution in Java


  • 7
    X
    public class Solution {
        public int maxProfit(int[] prices) {
            int len = prices.length;
            int profit = 0;
            for(int i = 1; i < len ; i++){
                if(prices[i]-prices[i-1] <= 0){
                    continue;
                }
                profit += 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.