int searchInsert(vector<int>& nums, int target) {
        int pos = -1;
        if (target > *(nums.end() - 1))
            return pos = nums.size() ;
        if (target < *nums.begin())
            return pos = 0;
        for (auto item = nums.begin(); item != nums.end(); ++item)
        {
            if (*item <= target)
                if (*item == target)
                    pos = item - nums.begin();
                else 
                    pos = item - nums.begin() +1;
            else 
                break;
        }
        return pos;
    }