LeetCode-35. 搜索插入位置（Search Insert Position）

二分

class Solution {
public:
    int searchInsert(vector<int>& nums, int target) {
        int i;
        if(target > nums[nums.size() - 1]){
        	return nums.size();
        }
        if(target < nums[0]) {
        	return 0;
        }
        int l = 0, r = nums.size() - 1;
        int mid;
        while(l <= r){
        	mid = (l + r) / 2;
        	if(nums[mid] == target){
        		return mid;
        	}else if(nums[mid] > target){
        		r = mid - 1;
        	}else{
        		l = mid + 1;
        	}
        }
        return l;
    }
};

题目链接：https://leetcode-cn.com/problems/search-insert-position/