萌新不知道怎么优化代码!!!
class Solution {
public:
int mySqrt(int x) {
if(x = =1)return 1;
if(x= =0)return 0;
int l=0,r=x,mid=0;
while(l<=r)
{
mid=l+(r-l)/2;
if(x/mid==mid)return mid;
else if(x/mid<mid) r=mid-1;
else l=mid+1;
}
return mid*mid>x?mid-1:mid;
}
};
leetcode,二分法实现int sqrt函数
最新推荐文章于 2022-07-12 21:20:18 发布