My Java solution


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