(Leetcode) Merge Sorted Array---merge arrays

Given sorted integer Arrays nums1 and nums2, merge nums2 into nums1 as one sorted Array.

Note:
Assume that nums1 have enough space (size that's greater or equal to m + n) to hold add Itional elements from nums2. The number of elements initialized in nums1 and nums2 is m and n respectively.

Subscribe to see which companies asked this question

Problem Solving Analysis:

Simple topic, merging two lists. The idea here is to say that another list is added to the back of a list and then sorted by size.

#-*-Coding:utf-8-*-__author__ = ' Jiuzhang ' class solution (object):    def merge (self, nums1, M, NUMS2, N):        nums1[m : M + n] = nums2[:n]        nums1.sort ()

(Leetcode) Merge Sorted Array---merge arrays