【二分法】LeetCode 35. Search Insert Position

LeetCode 35. Search Insert Position
Solution1：我的答案

class Solution {
public:
    int searchInsert(vector<int>& nums, int target) {
        if (!nums.size()) return 0;
        int left = 0, right = nums.size() - 1, mid = 0;
        while (left <= right) {
            int mid = (left + right)/2;
            if (nums[mid] < target)
                left = mid + 1;
            else if (nums[mid] > target)
                right = mid - 1;
            else return mid;
        }
        return left;//通过此题可以看出：普通的二分法结束时
    }               //left的值停在第一个>=target value的索引上
};