整数二分
int mid=(left+right)/2;
while(right>left){
if((mid/x+mid/y)+1>=n){
right=mid;
mid=(left+right)/2;
}
else{
left=mid+1;
mid=(left+right)/2;
}
}
答案不唯一时(对结果进行二分,不断调整)
对结果增加一次判断