88. Merge Sorted Array

Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.

Note:

You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional elements from nums2. The number of elements initialized in nums1 and nums2 are m and n respectively.

方法一：

class Solution(object):
    def merge(self, nums1, m, nums2, n):
        p, q = m-1, n-1
        while p >= 0 and q >= 0:
            if nums1[p] > nums2[q]:
                nums1[p+q+1] = nums1[p]
                p = p-1
            else:
                nums1[p+q+1] = nums2[q]
                q = q-1
        
        nums1[:q+1] = nums2[:q+1]  //[0],0,[1],1

方法二：

class Solution(object):
  def merge(self, nums1, m, nums2, n):
    i = n-1
    count = 0
    flag = 0
    while(i>=0 and i<n):
      flag = 0
      j = m+count-1
      print('i=',i,'j=',j)
      while(j>=0 and j<m+count):
        if nums2[i]>nums1[j]:
          nums1.insert(j+1,nums2[i])
          flag = 1
          count+=1
          break;
        else:
          j-=1
      if flag == 0:
        nums1.insert(0,nums2[i])
      i-=1
    nums1 = nums1[:m+n]  
    return nums1
Test = Solution()
nums1 = [1,3,5,7,9,11,13,15]
nums2 = [2,4,6,8,10,12,14,16]
print(Test.merge(nums1,5,nums2,5))

nums1 = [0]
nums2 = [1]
print(Test.merge(nums1,0,nums2,1))
Fuck，这种方法在Leetcode死活过不去。。。。。。。。