leetcode 35. Search Insert Position

1.题目

Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.

You may assume no duplicates in the array.

Here are few examples.
[1,3,5,6], 5 → 2
[1,3,5,6], 2 → 1
[1,3,5,6], 7 → 4
[1,3,5,6], 0 → 0

还是查找，如果找不到，返回应该插入的位置。

2.思路 

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