35. Search Insert Position

Source link: https://leetcode.com/problems/search-insert-position/

Design

The problem could be simply solved by the binary search approach.

Search Insert Position

Implementation

class Solution {
  public int searchInsert(int[] nums, int target) {
    int left = 0, 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 left;
  }
}

Complexity Analysis

Time: $O(logn)$

Space: $O(1)$