Java Solution with 1ms, comparing the adjacent two days' prices.


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

    }


Log in to reply
 

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