[LeetCode] 35. Search Insert Position

35. 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

 

Constraints:

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

---

문제 : target 이 nums 배열에 삽입/정렬되었을때, target 의 자리값(인덱스) 을 리턴

Runtime: 0 ms, faster than 100.00% of Java online submissions for Search Insert Position.

Memory Usage: 42 MB, less than 79.88% of Java online submissions for Search Insert Position.

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