61 二分查找

1.代码int searchInsert(int* nums, int numsSize, int target) { int l 0; int r numsSize-1; while(lr){ int mid (lr)/2; if(nums[mid]target) return mid; if(nums[mid]target){ r mid-1; } if(nums[mid]target){ l mid1; } } return l; }