Middle-题目13: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
题目大意:
给出一个排序好的数组,和一个目标值,求出把目标值插到原数组保持升序的情况下,目标值所在的数组下标。
题目分析:
在二分查找的基础上简单变形即可,需要注意目标值在两端的特殊情况。
源码:(language:java)

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

成绩:
0ms,beats 19.33%,众数0ms,90.67%

阅读更多
版权声明:完整版Leetcode题解请出门左转https://github.com/cmershen1/leetcode/tree/master/docs https://blog.csdn.net/cmershen/article/details/51546194
个人分类: Leetcode
上一篇Middle-题目12:96. Unique Binary Search Trees
下一篇Middle-题目14:141. Linked List Cycle
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭