Simple Java Solution 2ms


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

Log in to reply
 

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