leetcode

Solution to some Leetcode problems written in C++

git clone git://git.dimitrijedobrota.com/leetcode.git

2366.cpp (390B)

0 class Solution { 1 public: 2 long long minimumReplacement(vector<int> &nums) { 3 long long int res = 0; 4 for (int i = nums.size() - 2; i >= 0; i--) { 5 if (nums[i] <= nums[i + 1]) continue; 6 long long num = (nums[i] + nums[i + 1] - 1) / nums[i + 1]; 7 res += num - 1; 8 nums[i] = nums[i] / num; 9 } 10 return res; 11 } 12 };