35. Search Insert Position | LeetCode

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

Example 4:

Input: nums = [1,3,5,6], target = 0
Output: 0

Example 5:

Input: nums = [1], target = 0
Output: 0

Solution to the Above Question

class Solution {
public:
    int searchInsert(vector<int>& nums, int target) {
        map<int,int>mymap;
        for(int i=0; i<nums.size(); i++){
            mymap.insert({nums[i],i});
        }
        auto itr=mymap.find(target);
        if(itr!=mymap.end()){
            return itr->second;
            
            
            
        }
        else{
            if(target>nums[0]){
                
           while(itr==mymap.end()){
              
               target--;
               itr=mymap.find(target);
           }
               return (itr->second)+1;
            }
            else{
                return 0;
            }
        }
        return 0;
    }
};