Simple c++ binary search solution


  • 0
    I
    int searchInsert(vector<int>& nums, int target) {
        if (target > nums.back()) return nums.size();
        int left = 0, right = nums.size() - 1;
        while (left < right) {
    	    int mid = (left + right) / 2;
    	    if (nums[mid] >= target) {
    		    right = mid;
    	    } else {
    		    left = mid + 1;
    	    }
        }
        return left;
    }

Log in to reply
 

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