LeetCode-Search Insert Position

最新推荐文章于 2024-03-25 23:05:15 发布

disappearedgod

最新推荐文章于 2024-03-25 23:05:15 发布

阅读量786

点赞数

分类专栏： Sort LeetCode 文章标签： LeetCode Sort

本文链接：https://blog.csdn.net/disappearedgod/article/details/39179649

版权

LeetCode 同时被 2 个专栏收录

94 篇文章 0 订阅

订阅专栏

Sort

2 篇文章 0 订阅

订阅专栏

作者：disappearedgod

文章出处：http://blog.csdn.net/disappearedgod/article/details/39179649

时间：2014-9-10

题目

Search Insert Position

Total Accepted: 24487 Total Submissions: 69913 My Submissions

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[] A, int target) {
        int lo = -1;
        int hi = A.length;
        int mid = lo + (hi - lo)/2;
        while(lo+1 != hi){
            mid = lo + (hi - lo)/2;
            if(A[mid] == target)
                return mid;
            else if(A[mid] > target){
                if(mid > 1 && A[mid-1] < target)
                    return mid;
                else if(mid == 0 )
                    return mid;
                hi = mid;
            }
            else{
                if( A.length > mid + 1 && A[mid+1] > target)
                    return mid+1;
                else if(A.length == mid + 1)
                    return mid+1;
                lo = mid;
            }
        }
        return mid;
        
    }
}

结果