[Leetcode] Search Insert Position

标签：style   blog   color   io   os   ar   sp   div   on   

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

Solution:

public class Solution {
    public int searchInsert(int[] A, int target) {
        int i=0,j=A.length-1;
        while(i<=j){
            int mid=(i+j)/2;
            if(target==A[mid])
                return mid;
            else if(target<A[mid])
                j=mid-1;
            else
                i=mid+1;
        }
        return i;
    }
}

[Leetcode] Search Insert Position

标签：style   blog   color   io   os   ar   sp   div   on   

原文地址：http://www.cnblogs.com/Phoebe815/p/4034185.html