leetcode专题训练 35. Search Insert Position

很简单的二分查找题目

class Solution {
private:
    static int BinarySearch(int left, int right, vector<int>& nums, int target)
    {
        int mid;
        while (left <= right) {
            mid = (left + right) >> 1;
            if (nums[mid] == target) return mid;
            if (nums[mid] < target) left = mid + 1;
            else right = mid - 1;
        }
        return left;
    }
public:
    int searchInsert(vector<int>& nums, int target) {
        int l = nums.size();
        if (l == 0) return 0;
        int result = BinarySearch(0, l - 1, nums, target);
        return result;
    }
};