src/main/java/com/fishercoder/solutions/_35.java

package com.fishercoder.solutions;

public class _35 {

    public static class Solution1 {
        public int searchInsert(int[] nums, int target) {
            int left = 0;
            int right = nums.length - 1;
            while (left < right) {
                int mid = left + (right - left) / 2;
                if (nums[mid] == target) {
                    return mid;
                } else if (nums[mid] < target) {
                    left = mid + 1;
                } else {
                    right = mid - 1;
                }
            }
            return nums[left] >= target ? left : left + 1;
        }
    }

}