摘要：
二分查找 class Solution { public boolean isPerfectSquare(int num) { int left = 1; int right = num; while (left <= right){ int mid = left + (right - left) 阅读全文
posted @ 2022-02-16 21:28
振袖秋枫问红叶
阅读(33)
评论(0)
推荐(0)
摘要：
二分查找 class Solution { public int mySqrt(int x) { int left = 0; int right = x; while (left <= right){ int mid = left + (right - left) / 2; /** * 避免整形溢出 阅读全文
posted @ 2022-02-16 21:22
振袖秋枫问红叶
阅读(18)
评论(0)
推荐(0)
摘要：
两个二分查找分别寻找 class Solution { public int[] searchRange(int[] nums, int target) { /** * 分别寻找第一个和最后一个target */ int left = 0; int right = nums.length - 1; 阅读全文
posted @ 2022-02-16 20:30
振袖秋枫问红叶
阅读(30)
评论(0)
推荐(0)
摘要：
二分查找 class Solution { public int searchInsert(int[] nums, int target) { /** * 左闭右闭写法，left可以等于right */ int left = 0; int right = nums.length - 1; while 阅读全文
posted @ 2022-02-16 19:35
振袖秋枫问红叶
阅读(36)
评论(0)
推荐(0)
浙公网安备 33010602011771号