LeetCode：给定一个排序数组和一个目标值，在数组中找到目标值，并返回其索引。如果目标值不存在于数组中，返回它将会被按顺序插入的位置。

#include <iostream>
#include <string>
#include <vector>
using namespace std;

class Solution
{
public:
    vector<int> nums;

public:
    int searchInsert(vector<int> &nums, int target)
    {
        int n = nums.size();
        int left = 0, right = n - 1, ans = n;
        while (left <= right)
        {
            int mid = ((right - left) >> 1) + left;
            if (target <= nums[mid])
            {
                ans = mid;
                right = mid - 1;
            }
            else
            {
                left = mid + 1;
            }
        }
        return ans;
    }
};

void test01()
{
    Solution s;
    int res;

    s.nums.push_back(1);
    s.nums.push_back(3);
    s.nums.push_back(5);
    s.nums.push_back(6);

    res = s.searchInsert(s.nums, 0);
    cout << res << endl;
}

int main()
{
    test01();

    system("pause");
    return 0;
}

// https://leetcode-cn.com/problems/search-insert-position/