Leetcode 88. Merge Sorted Array

python二分插入,使用bisect(教程)

import bisect


class Solution(object):
    def merge(self, nums1, m, nums2, n):
        for i in range(n):
            bisect.insort_left(nums1, nums2[i], 0, m)
            m += 1
        del nums1[m:]
        return