Solution for Search Insert Position


  • 0
    A
    class Solution {
    public:
        int searchInsert(vector<int>& nums, int target) {
            int i;
            for(i=0; i<nums.size(); ++i)
                if(target <= nums[i])
                    return i;
            return i;
        }
    };
    

    Time complexity O(n)


Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.