leetcode-35. Search Insert Position

https://leetcode.com/problems/search-insert-position/#/description
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

思路解析：二分查找思想

代码如下：

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