题目描述

java代码

class Solution {public int searchInsert(int[] nums, int target) {for(int i=0;i<nums.length;i++){if(nums[i]>=target){return i;}}return nums.length;}
}

二分法

class Solution {public int searchInsert(int[] nums, int target) {int left=0,right=nums.length-1;if(target<nums[left]) return 0;if(target>nums[right]) return nums.length;while(left<=right){int mid=(left+right)/2;if(target<nums[mid]){right=mid-1;}else if(target>nums[mid]){left=mid+1;}else{return mid;}}return left;}
}