35_SearchInsertPosition - a920604a/leetcode GitHub Wiki

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

class Solution {
public:
    int searchInsert(vector<int>& nums, int target) {
        int n = nums.size(), l=0,r=n-1;
        while(l<=r){
            int mid = l+(r-l)/2;
            if(nums[mid] ==target) return mid;
            else if(nums[mid] < target) l = mid+1;
            else r = mid-1;
        }
        return l ;
        
    }
};

class Solution {
public:
    int searchInsert(vector<int>& nums, int target) {
        int n = nums.size(), l=0,r=n;
        while(l<r){
            int mid = l+(r-l)/2;
            if(nums[mid] ==target) return mid;
            else if(nums[mid] < target) l = mid+1;
            else r = mid;
        }
        return l ;
        
    }
};