leetcode

Solution to some Leetcode problems written in C++

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

2616.cpp (634B)

0 class Solution { 1 int count(const vector<int> &nums, int treshold) { 2 int cnt = 0; 3 for (int i = 1; i < nums.size(); i++) { 4 if (nums[i] - nums[i - 1] <= treshold) cnt++, i++; 5 } 6 return cnt; 7 } 8 9 public: 10 int minimizeMax(vector<int> &nums, int p) { 11 sort(nums.begin(), nums.end()); 12 int left = 0, right = nums.back() - nums.front(); 13 while (left < right) { 14 int mid = left + (right - left) / 2; 15 if (count(nums, mid) >= p) 16 right = mid; 17 else 18 left = mid + 1; 19 } 20 return left; 21 } 22 };