[88] Merge Sorted Array

https://leetcode.com/problems/merge-sorted-array/description/

• algorithms
• Easy (33.92%)
• Source Code: 88.merge-sorted-array.py
• Total Accepted: 349.9K
• Total Submissions: 989.5K
• Testcase Example: '[1,2,3,0,0,0]\n3\n[2,5,6]\n3'

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

Note:

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

Example:

Input: nums1 = [1,2,3,0,0,0], m = 3 nums2 = [2,5,6], n = 3

Output: [1,2,2,3,5,6]

#coding: utf-8
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: None Do not return anything, modify nums1 in-place instead.
        """
        nums1[m:m+n] = nums2
        nums1[:m+n] = sorted(nums1[:m+n])




# ✘ Wrong Answer
# ✘ 20/59 cases passed (N/A)
# ✘ testcase: '[4,5,6,0,0,0]\n3\n[1,2,3]\n3'
# ✘ answer: [2,3,1,4,5,6]
# ✘ expected_answer: [1,2,3,4,5,6]