79 leetcode - Merge Sorted Array

#!/usr/bin/python# -*- coding: utf-8 -*-'''Merge Sorted ArrayGiven 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):        """        :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.        """        if n == 0:            return        ret = []        index1,index2 = m - 1,n - 1        index = m + n - 1        while index1 >= 0 and index2 >= 0:            if nums1[index1] > nums2[index2]:                nums1[index] = nums1[index1]                index1 -= 1            else:                nums1[index] = nums2[index2]                index2 -= 1            index -= 1        while index1 >= 0:            nums1[index] = nums1[index1]            index1 -= 1            index -= 1        while index2 >= 0:            nums1[index] = nums2[index2]            index2 -= 1            index -= 1if __name__ == "__main__":    s = Solution()    a = range(15)    s.merge(a,4,range(8),8)    print a