class Solution(object):

def merge(self, nums1, m, nums2, n):

```
if len(nums1)<m+n:
return -1
for i in range(n):
nums1[m+i]=nums2[i]
nums1=nums1[0:m+n]
nums1.sort()
```

I do not know why my answer is wrong?? please help me ,Thank you!