[LeetCode] 35. Search Insert Position - java

[문제]

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.

배열 중 target과 같은 값이 있다면 그 값을 return 시키고 그렇지 않다면 그 값이 어디에 들어갈 지 알아내라.

 

[입출력 예]

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

 

[답]