[LeetCode] 35. Search Insert Position

Problem :  https://leetcode.com/problems/search-insert-position/

Time Complexity : O( Log( len(nums ) ) )

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

Edited on 11/25/2021. Update the Java solution.