class Solution {
public:
int mySqrt(int x) {
int left=0;
int right=x;
while(left<=right)
{
long mid=(right+left)/2;
if(mid*mid==x)
{
return mid;
}
else if(mid*mid>x)
{
right=mid-1;
}
else{
left=mid+1;
}
}
return right;
}
};
利用二分法查找x的平方根
最新推荐文章于 2021-08-16 09:24:52 发布