No35_搜索插入位置 public int searchInsert(int[] nums, int target) { int start = 0; int end = nums.length -1; while(start <= end){ int mid = start + ((end - start) >> 1); // mid >= start if(nums[mid] > target){ end = mid - 1; }else if(nums[mid] < target)