35.search-insert-position.cpp

/*
 * @lc app=leetcode id=35 lang=cpp
 *
 * [35] Search Insert Position
 */

// @lc code=start
class Solution
{
public:
    int searchInsert(vector<int> &nums, int target)
    {
        int left(0), right = nums.size();
        int mid;

        if (target > nums[right - 1])
        {
            return right;
        }

        while (left <= right)
        {
            mid = (left + right) / 2;

            if (nums[mid] == target)
            {
                return mid;
            }

            if (target < nums[mid])
            {
                right = mid - 1;
            }
            else
            {
                left = mid + 1;
            }
        }

        return left;
    }
};
// @lc code=end