88. Merge Sorted Array

题目链接：https://leetcode.com/problems/merge-sorted-array/

代码

class Solution:
    def merge(self, nums1: List[int], m: int, nums2: List[int], n: int) -> None:
        """
        Do not return anything, modify nums1 in-place instead.
        """
        if not nums2 : return 
        nums1[m:]=nums2[:]
        nums1.sort()
        return 

思路

1. 把数组2放入数组1的后面
2. 排序
   感觉有点投机取巧，然而结果却很漂亮~