LeetCode 35. Search Insert Position 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.

Example 1:

Input: [1,3,5,6], 5
Output: 2

Example 2:

Input: [1,3,5,6], 2
Output: 1

Example 3:

Input: [1,3,5,6], 7
Output: 4

Example 4:

Input: [1,3,5,6], 0
Output: 0

---

Seen this question in a real interview before?  

Yes

No

class Solution {
   public int searchInsert(int[] nums, int target) {
        int n = nums.length;
        int lo = 0, hi = n-1;
        int mid = 0;
        while(lo < hi){
            mid = (lo+hi)/2;
            if(target == nums[mid]){
                return mid;
            }
            else if(target < nums[mid]){
                hi = mid-1;
            }
            else{
                lo = mid+1;
            }
        }
        if(lo == hi){
            if(target > nums[hi]){
                return hi+1;
            }
            else{
                return hi;
            }
        }
        return mid;
    }
}