class Solution {
public:
int sqrt(int x) {
long long left = 0;
long long right = x;
while (left <= right)
{
long long mid = left + (right - left) / 2;
long long square = mid*mid;
if (square < x)
left = mid + 1;
else if (square>x)
right = mid - 1;
else
return mid;
}
return (int)right;
}
};
【LeetCode】Sqrt(x)
最新推荐文章于 2021-11-24 12:17:16 发布