Search Insert Position

07 Aug 2025 in Dev / Codingtest on CodingTest

• LeetCode Search Insert Position
  • 문제
  • 예시
• 풀이

LeetCode Search Insert Position

문제

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

풀이

class Solution:
    def searchInsert(self, nums: List[int], target: int) -> int:
        if target in nums:
            return nums.index(target)
        else:
            nums.append(target)
            sort_nums = sorted(nums)
            return sort_nums.index(target)