二分法:
对应leetcode 第35题 搜索插入位置
记录一下
class Solution { public int searchInsert(int[] nums, int target) { int right=nums.length-1; int left=0; while (left<=right){ int mid=(left+right)/2; if (nums[mid]<target){ left=mid+1; }else if(nums[mid]>target){ right=mid-1; }else { return mid; } } return left; }