关闭

88. Merge Sorted Array*

88人阅读 评论(0) 收藏 举报
分类:

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.

My code:

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 
        if m == 0:
            nums1.extend(nums2)
            return 
        p1 = 0
        p2 = 0
        while p2<n and p1<m+n:
            if nums2[p2]<=nums1[p1]:
                nums1.insert(p1,nums2[p2])
                p2+=1
            p1+=1
        nums1.extend(nums2[p2:])
            


0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:61328次
    • 积分:3905
    • 等级:
    • 排名:第8530名
    • 原创:332篇
    • 转载:90篇
    • 译文:0篇
    • 评论:11条
    最新评论