1362. Closest Divisors

Given an integer num, find the closest two integers in absolute difference whose product equals num + 1 or num + 2.

Return the two integers in any order.

class Solution {
    vector<int> helper(int n) {
        int s = sqrt(n);
        while(s) {
            if(n % s == 0) return {s, n/s};
            s--;
        }
        return {};
    }
public:
    vector<int> closestDivisors(int num) {
        vector<int> A = helper(num + 1), B = helper(num + 2);
        return abs(A[0] - A[1]) < abs(B[0] - B[1]) ? A : B;
    }
};