Given a sorted array of distinct integers 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 must write an algorithm with O(log n) runtime complexity.

    Example 1: Input: nums = [1,3,5,6], target = 5 Output: 2

    Example 2: Input: nums = [1,3,5,6], target = 2 Output: 1

    Example 3: Input: nums = [1,3,5,6], target = 7 Output: 4

    Constraints: 1 <= nums.length <= 104 -104 <= nums[i] <= 104 nums contains distinct values sorted in ascending order. -104 <= target <= 104

    1. class Solution {
    2.     public int searchInsert(int[] nums, int target) {
    3.         int left = 0;
    4.         int right = nums.length - 1;
    5.         int mid = 0;
    6.         while(left <= right){
    7.             mid = left + (right - left) / 2;
    8.             if(nums[mid] > target)
    9.                 right = mid - 1;
    10.             else if(nums[mid] < target)
    11.                 left = mid + 1;
    12.             else
    13.                 return mid;
    14.         }
    15.         return right + 1;
    16.     }
    17. }

    When the problem is in ascending order, binary search should be considered.