35. Search Insert Position.md

Problem Source

https://leetcode.com/problems/search-insert-position/

Problem Description

Given a sorted array 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 may assume no duplicates in the array.

Example 1:

Input: [1,3,5,6], 5
Output: 2
Example 2:

Input: [1,3,5,6], 2
Output: 1
Example 3:

Input: [1,3,5,6], 7
Output: 4
Example 4:

Input: [1,3,5,6], 0 
Output: 0

Thought

• Iterate through
• Quicker solution will be use binary search O(log(n))

Keypoints

• Binary Search

Code

• Language: Java

class Solution {
    public int searchInsert(int[] nums, int target) {
        if(target<nums[0])return 0;
        
        for(int i=0;i<nums.length;i++){
            if(target==nums[i])return i;
            if(target<nums[i])return i;
        }
        return nums.length;
    }
}

Complexity

• Time Complexity：O(N)
• Space Complexity：O(1)