LeetCode-Easy刷题(10) Search Insert Position

Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.

You may assume no duplicates in the array.

Example 1:

Input: [1,3,5,6], 5
Output: 2

Example 2:

Input: [1,3,5,6], 2
Output: 1

Example 3:

Input: [1,3,5,6], 7
Output: 4

Example 1:

Input: [1,3,5,6], 0
Output: 0

给定一个排序数组和一个目标值，如果找到目标，就返回索引。如果没有，则返回该索引的位置，如果该索引是按顺序插入的。

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