C++ concise solution.


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

Log in to reply
 

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