[LeetCode/JavaScript] 35. Search Insert Position (easy)

 

문제 

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 <= 10^4
• -10^4 <= nums[i] <= 10^4
• nums contains distinct values sorted in ascending order.
• -10^4 <= target <= 10^4

 

 

코드

var searchInsert = function(nums, target) {
    let result = 0;
    for(i=0; i<nums.length; i++) {
        if(nums[i]>=target) {
            return i;
        }
        else if(i===nums.length-1){
            return i+1;
        }
    }
};