Closest Divisors LeetCode solution in C++

1
class Solution {
2
 public:
3
  vector<int> findnumbers(int num) {
4
    int m = sqrt(num);
5
    while (num % m != 0) {
6
      m--;
7
    }
8
    return {num / m, m};
9
  }
10
  vector<int> closestDivisors(int num) {
11
    vector<int> ans1 = findnumbers(num + 1);
12
    vector<int> ans2 = findnumbers(num + 2);
13
    if (abs(ans1[0] - ans1[1]) < abs(ans2[0] - ans2[1])) return ans1;
14
    return ans2;
15
  }
16
};