LeetCode-in-Java
3326. Minimum Division Operations to Make Array Non Decreasing
Medium
You are given an integer array nums.
Any positive divisor of a natural number x that is strictly less than x is called a proper divisor of x. For example, 2 is a proper divisor of 4, while 6 is not a proper divisor of 6.
You are allowed to perform an operation any number of times on nums, where in each operation you select any one element from nums and divide it by its greatest proper divisor.
Return the minimum number of operations required to make the array non-decreasing.
If it is not possible to make the array non-decreasing using any number of operations, return -1.
Example 1:
Input: nums = [25,7]
Output: 1
Explanation:
Using a single operation, 25 gets divided by 5 and nums becomes [5, 7].
Example 2:
Input: nums = [7,7,6]
Output: -1
Example 3:
Input: nums = [1,1,1,1]
Output: 0
Constraints:
1 <= nums.length <= 1051 <= nums[i] <= 106
Solution
public class Solution {
private static final int MAXI = 1000001;
private static final int[] SIEVE = new int[MAXI];
private static boolean precompute = false;
private static void compute() {
if (precompute) {
return;
}
for (int i = 2; i < MAXI; i++) {
if (i * i > MAXI) {
break;
}
for (int j = i * i; j < MAXI; j += i) {
SIEVE[j] = Math.max(SIEVE[j], Math.max(i, j / i));
}
}
precompute = true;
}
public int minOperations(int[] nums) {
compute();
int op = 0;
int n = nums.length;
for (int i = n - 2; i >= 0; i--) {
while (nums[i] > nums[i + 1]) {
if (SIEVE[nums[i]] == 0) {
return -1;
}
nums[i] /= SIEVE[nums[i]];
op++;
}
if (nums[i] > nums[i + 1]) {
return -1;
}
}
return op;
}
}