力扣搜索插入位置

class Solution {
public:
    int searchInsert(vector<int>& nums, int target) {
        int m=nums.size();
        for (int i=0;i<m;i++)
        {
            if (nums[i]==target)
            {
                return i;
            }
            else if(i<m-1&&nums[i]<target&&target<nums[i+1])
            {
                return i+1;
            }
            else if(i==0&&nums[0]>target)
            {
                return 0;
            }
            else if(i==m-1&&target>nums[m-1])
            {
                return m;
            }
            else 
            {
                continue;
            }
        }
    return m;
    }
};