Search Insert Position - Leetcode

searchInsert.java

/*
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

Algorithm:
Basically it is a binary search, but at the end if it does not find the result in the array,
if A[mid] > target then mid else mid + 1
*/
public class Solution {
    public int searchInsert(int[] A, int target) {
        // Start typing your Java solution below
        // DO NOT write main() function
        int left = 0;
        int right = A.length - 1;
        int mid = 0;
        while(right >= left) {
            mid = (left + right) / 2;
            if(A[mid] == target) {
                return mid;
            } else if(A[mid] > target) {
                right = mid - 1;
            } else if(A[mid] < target) {
                left = mid + 1;
            }
        }
        if(A[mid] > target) return mid;
        else return mid+1;
    }
}