二分查找
菜鸡快飞
这个作者很懒,什么都没留下…
展开
-
x的平凡根
69 // 二分查找 class Solution { public int mySqrt(int x) { long l=0, r=x; while(l < r){ long m = (l+r+1) >>> 1; if(m*m > x) r = m - 1; else l = m; //[l,r] } return (int)l;原创 2022-05-27 15:14:02 · 89 阅读 · 0 评论 -
寻找旋转排序数组中的最小值
153 要找最小值,就与最大值比较 class Solution { public int findMin(int[] nums) { int left = 0, right = nums.length - 1; while(left < right){ int mid = (left + right) >>> 1; if(nums[mid] > nums[right]){原创 2022-05-13 23:08:54 · 48 阅读 · 0 评论 -
二分查找--单调性
33.搜索旋转排序数组 class Solution { public int search(int[] nums, int target) { int left = 0, right = nums.length - 1; while(left < right){ int mid = (left + right) >>> 1; if(nums[mid] == target) return mid;原创 2022-05-13 22:02:41 · 149 阅读 · 0 评论