O(n) using DP


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

Log in to reply
 

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