Leetcode练习题Search Insert Position

Question:

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 4:

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

Answer

class Solution {
    public 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)
            {
                right = mid - 1;
            }
            else if(nums[mid]<target)
            {
                left = mid + 1;
            }
            else
            {
                return mid;
            }
        }

        if(nums[left]<target)
        {
            return left+1;
        }
        else
        {
            return left;
        }

    }
}

效率：