leetcode

Solution to some Leetcode problems written in C++

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

1362.cpp (296B)

0 class Solution { 1 public: 2 vector<int> closestDivisors(const int num) const { 3 for (int i = sqrt(num + 2); i > 0; i--) { 4 if ((num + 1) % i == 0) return {i, (num + 1) / i}; 5 if ((num + 2) % i == 0) return {i, (num + 2) / i}; 6 } 7 return {}; 8 } 9 };