摘要:
public int mySqrt(int x) { int l = 0, r = x, ans = -1; while (l <= r) { int mid = l + (r-l)/2; if((long) mid * mid <= x) { ans = mid; l = mid +1; } el 阅读全文
摘要:
public int search(int[] nums, int target) { // 第一段满足第二段不满足 x>=nums[0],边界点就是满足这个性质的最后一个数字 int l = 0, r = nums.length-1; while (l < r) { int mid = l + r 阅读全文