[leetcode] 35. Search Insert Position

boricat·2021년 10월 18일
0

leetcode

목록 보기
5/14

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
Example 4:

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

Input: nums = [1], target = 0
Output: 0

Constraints:

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



class Solution {
  public int searchInsert(int[] nums, int target) {
  int i = 0;
  while (i < nums.length && nums[i] < target) {
    i++;
  	}
  return i;
  }
}
profile
newbie

0개의 댓글