Search Insert Position

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

	}
};