《剑指 offer》相关
TopK问题
按一定规律打印数组
排序数组查找数据
合并两个有序数组
N数之和系列
LeetCode
class Solution {
public int mySqrt(int x) {
int left = 0, right = x, result = -1;
while (left <= right) {
int mid = left + (right - left) / 2;
if ((long) mid * mid <= x) {
result = mid;
left = mid + 1;
} else {
right = mid - 1;
}
}
return result;
}
}