[leetcode:python]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.
题意：
给定两有序数组，将它们合并为一个有序数组。
注意：
假定nums1有足够大的空间。

方法一：性能46ms

class Solution(object):
    def merge(self, nums1, m, nums2, n):
        """
        :type nums1: List[int]
        :type m: int
        :type nums2: List[int]
        :type n: int
        :rtype: void Do not return anything, modify nums1 in-place instead.
        """
        tag = len(nums1)
        while tag > m:
            nums1.pop()
            tag -= 1
        nums1.extend(nums2[0:n])
        nums1.sort()

方法二：性能39ms

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