leetcode

Solution to some Leetcode problems written in C++

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

1283.cpp (463B)

0 class Solution { 1 public: 2 int smallestDivisor(const vector<int> &nums, int threshold) const { 3 int left = 1, right = 1000000; 4 while (left < right) { 5 int mid = left + (right - left) / 2, sum = 0; 6 for (const int num : nums) 7 sum += (num + mid - 1) / mid; 8 if (sum > threshold) 9 left = mid + 1; 10 else 11 right = mid; 12 } 13 return left; 14 } 15 };