g1101_1200.s1187_make_array_strictly_increasing.Solution Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java21 Show documentation

Java-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.37

package g1101_1200.s1187_make_array_strictly_increasing;

// #Hard #Array #Dynamic_Programming #Binary_Search
// #2022_03_03_Time_33_ms_(95.51%)_Space_42.4_MB_(82.02%)

import java.util.Arrays;

public class Solution {
    public int makeArrayIncreasing(int[] arr1, int[] arr2) {
        Arrays.sort(arr2);
        int start = 0;
        for (int i = 0; i < arr2.length; i++) {
            if (arr2[i] != arr2[start]) {
                arr2[++start] = arr2[i];
            }
        }
        int l2 = start + 1;
        int[] dp = new int[l2 + 2];
        for (int i = 0; i < arr1.length; i++) {
            int noChange = dp[dp.length - 1];
            if (i > 0 && (arr1[i - 1] >= arr1[i])) {
                noChange = -1;
            }
            for (int j = dp.length - 2; j > 0; j--) {
                if (arr2[j - 1] < arr1[i] && dp[j] != -1) {
                    noChange = noChange == -1 ? dp[j] : Math.min(noChange, dp[j]);
                }
                if (dp[j - 1] != -1) {
                    dp[j] = 1 + dp[j - 1];
                } else {
                    dp[j] = -1;
                }
                if (i > 0 && arr1[i - 1] < arr2[j - 1] && dp[dp.length - 1] >= 0) {
                    dp[j] =
                            dp[j] == -1
                                    ? (dp[dp.length - 1] + 1)
                                    : Math.min(dp[j], dp[dp.length - 1] + 1);
                }
            }
            dp[0] = -1;
            dp[dp.length - 1] = noChange;
        }
        int res = -1;
        for (int num : dp) {
            if (num != -1) {
                res = res == -1 ? num : Math.min(res, num);
            }
        }
        return res;
    }
}