Search Insert Position(Medium)

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 int searchInsert(int[] nums, int target) {
        int lo = 0, hi = nums.length - 1;
        //if target > all numbers
        if(nums[hi] < target) return nums.length;
            //general binary search
        while(lo < hi) {
            int mid = lo + (hi - lo)/2;
            if(nums[mid] == target) {
                return mid;
            } else if(nums[mid] < target){
                lo = mid + 1;
            } else {
                hi = mid;// take seriously! NOT hi = mid - 1;
            }
        }
        return  lo;
}