leetcode 35 search insert position

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.

Example 1:

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

Example 2:

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

Example 3:

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

Example 1:

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


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

简单的二分查找。

leetcode 35 search insert position

35. Search Insert Position

近期文章

近期评论

标签

热门

文章归档

分类目录

功能