Leetcode 35: Search Insert Position

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 1:

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

public class Solution {
    public int SearchInsert(int[] nums, int target) {
        int low = 0, high = nums.Length;
        
        while (low < high)
        {
            int mid = low + (high - low) / 2;
            
            if (nums[mid] == target)
            {
                return mid;
            }
            else if (nums[mid] < target)
            {
                if (mid < nums.Length - 1 && target < nums[mid + 1])
                {
                    return mid + 1;
                }
                
                low = mid + 1;
            }
            else
            {
                if (mid > 0 && target > nums[mid - 1])
                {
                    return mid;
                }
                
                high = mid;
            }
        }
        
        return low;
    }
}