leetcode(十二)搜索插入位置

方法一：递归版二分查找

class Solution {
public:
    int searchInsert(vector<int>& nums, int target) {

        int left = 0;
        int right = nums.size()-1;
        return splitFind(nums,left,right,target);
        

    }
    int splitFind(vector<int>& nums,int left,int right,int target)
    {
        int mid = (left+right)/2;
        if(nums[mid]==target)
            return mid;
        if(left>right)
            return left;
        if(nums[mid]>target)
            return splitFind(nums,left,mid-1,target);
        else(nums[mid]<target);
           return splitFind(nums,mid+1,right,target);
        return 0;
    }
};

方法二：

非递归二分查找。

class Solution {
public:
    int searchInsert(vector<int>& nums, int target) {

        int left = 0;
        int right = nums.size()-1;
        int mid = 0;
        while(left<=right)
        {
            mid = (left+right)/2;
            if(nums[mid]==target)
                return mid;
            else if(nums[mid]>target)
                right = mid-1;
            else
                left = mid+1;

        }
        return left;
        

    }

};