leetcode/Easy/SearchInsertPosition.java at master · Jatin-8898/leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
class Solution {
    public int searchInsert(int[] A, int target) {
        int low = 0, high = A.length-1;

        while(low <= high){

            int mid = (low + high)/2;

            if(A[mid] == target)
                return mid;

            else if(A[mid] > target)
                high = mid-1;

            else low = mid+1;
        }
        return low;
    }
}