Minimum Replacements to Sort the Array LeetCode solution in JavaScript

1
/**
2
 * @param {number[]} nums
3
 * @return {number}
4
 */
5
var minimumReplacement = function (nums) {
6
  const n = nums.length;
7
  let ans = 0;
8
  for (let i = n - 2; i >= 0; i--) {
9
    if (nums[i] > nums[i + 1]) {
10
      const temp = Math.ceil(nums[i] / nums[i + 1]);
11
      ans += temp - 1;
12
      nums[i] = Math.floor(nums[i] / temp);
13
    }
14
  }
15
  return ans;
16
};