简单题
class Solution {
public:
vector<int> func(int num){
int num1, num2;
for(int i=int(sqrt(num));i>=1;i--){
num1 = i;
if (num%num1==0){
num2 = num/num1;
vector<int> temp;
temp.push_back(num1);
temp.push_back(num2);
return temp;
}
}
cout<<"error!!"<<endl;
vector<int> temp;
return temp;
}
vector<int> closestDivisors(int num) {
vector<int> temp1 = func(num+1);
vector<int> temp2 = func(num+2);
int diff1 = abs(temp1[0]-temp1[1]);
int diff2 = abs(temp2[0]-temp2[1]);
if (diff1<diff2){
return temp1;
}
else{
return temp2;
}
}
};