Algo.Java.Find2Mins.InO(n)

123

   // https://leetcode.com/problems/divide-an-array-into-subarrays-with-minimum-cost-i/ 
    public int minimumCost(int[] nums) {
        int min=Integer.MAX_VALUE, secondMin=Integer.MAX_VALUE;
        for (int i=1; i<nums.length; i++) { // Loop through the entire array
    public int minimumCost(int[] nums) {
        int min=Integer.MAX_VALUE, secondMin=Integer.MAX_VALUE;
        for (int i=1; i<nums.length; i++) { // Loop through the entire array
            if (nums[i] < min) {
                secondMin = min;
                min = nums[i];
            } else if (nums[i] < secondMin) {
                secondMin = nums[i];
            }

        }


        return nums[0]+min+secondMin;
    }