日积月累，天道酬勤

题目思路显然考察的是归并排序算法的核心：归并操作的熟练度。代码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 anyt

题目解法一不就是排序吗，这是我见过最简单的题目哈哈。class Solution(object): def sortColors(self, nums): """ :type nums: List[int] :rtype: None Do not return anything, modify nums in-place instead. """ return nums.sort()结果还不错，平常碰到这种