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

public class Solution {
    public int searchInsert(int[] A, int target) {
        // Note: The Solution object is instantiated only once and is reused by each test case.
        if(A == null || A.length == 0 || target < A[0]) return 0;
        int len = A.length;
        for(int i = 0; i < len; i ++){
            if(A[i] == target){
                return i;
            }
            else if(A[i] > target){
                return i;
            }
        }
        return len;
    }
}

 第二遍：

采用二分来做。

public class Solution {
    public int searchInsert(int[] A, int target) {
        // Note: The Solution object is instantiated only once and is reused by each test case.
        if(A == null || A.length == 0 || target < A[0]) return 0;
        int len = A.length;
        int start = 0;
        int end = len - 1;
        int ret = end;
        while(start <= end){
            int mid = (start + end) / 2;
            if(target == A[mid]) return mid;
            if(target < A[mid]){
                ret = mid;
                end = mid - 1;
            }else{
                ret = mid + 1;
                start = mid + 1;
            }
        }
        return ret;
    }
}