LeetCode 35. 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.

Here are few examples.
[1,3,5,6], 5 → 2
[1,3,5,6], 2 → 1
[1,3,5,6], 7 → 4
[1,3,5,6], 0 → 0

Subscribe to see which companies asked this question.

在一个有序数组里面找一个数的索引 没有则返回这个数应该插入的位置。

二分查找，很简单。

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