Create Minimum Replacements to Sort the Array.java

varunu28 · web-flow · commit d9c6a40491a4 · 2023-08-30T08:02:04.000-07:00
diff --git a/Hard/Minimum Replacements to Sort the Array.java b/Hard/Minimum Replacements to Sort the Array.java
@@ -0,0 +1,14 @@
+class Solution {
+    public long minimumReplacement(int[] nums) {
+        int n = nums.length;
+        long numOfOperations = 0;
+        for (int i = n - 2; i >= 0; i--) {
+            if (nums[i] > nums[i + 1]) {
+                long numElements = (long)(nums[i] + nums[i + 1] - 1) / (long)nums[i + 1];
+                numOfOperations += numElements - 1;
+                nums[i] = nums[i] / (int)numElements;
+            }
+        }
+        return numOfOperations;
+    }
+}
