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 itwould 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

    谷歌翻译：给定一个排序数组和一个目标值，如果找到目标，则返回索引。 如果没有，返回索引的位置，如果它是按顺序插入。您可以假设数组中没有重复项。

这里有几个例子。

[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 left=0,right=nums.length-1;

                   intmid;

                   while(left<=right){

                            mid=(left+right)/2;

                            if(nums[mid]==target){

                                     returnmid;

                            }elseif(nums[mid]>target){

                                     right=mid-1;

                            }elseif(nums[mid]<target){

                                     left=mid+1;

                            }

                   }

                   returnleft;

    }

}