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.

Have you met this question in a real interview? 

Yes

Example

[1,3,5,6], 5 → 2

[1,3,5,6], 2 → 1

[1,3,5,6], 7 → 4

[1,3,5,6], 0 → 0

Challenge

public class Solution {

    /** 

     * param A : an integer sorted array

     * param target :  an integer to be inserted

     * return : an integer

     */

    public int searchInsert(int[] A, int target) {

        // write your code here

        

        int start = 0, end = A.length - 1;

        while(start <= end){

            int mid = (start + end) / 2;

            if(A[mid] == target){

                return mid;

            } else if(A[mid] < target){

                start = mid + 1;

            } else{

                end = mid - 1;

            }

        }

        return start;

        

    }

}