clueless coding // TODO: be smarter

LeetCode Search Insert Position: CPP Solution



TL;DR Code Solution


int searchInsert(vector<int>& nums, int target) {

    int left = 0;
    int right = nums.size() - 1;

    while (left <= right) {

        int middle = (left + right) / 2;
        if (nums[middle] < target) {
            left = middle + 1;
        }
        else if (nums[middle] > target) {
            right = middle - 1;
        }
        else {
            return middle;
        }            
    }

    return left;

}