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]
这个题目思路就是用two pointers, 我想的是用三个指针, 一个m指向最后nums1的最后一个, 一个n指向nums2的最后一个, 一个l指向m+n-1的最后一个.然后分别比较m 与n,依次将最大的值放在l上,
如果n == 0,也就是说第二个数组nums2已经全移上来了,那么就结束while loop; 而如果是m== 0 的话, 我们就继续移动nums2, 直到nums2被移动完为止.
class Solution: def mergeTwoSortedArray(self, nums1, m, nums2, n): l = m + n -1 while n >0: if m == 0 or nums2[n-1] > nums1[m-1]: nums1[l] = nums2[n-1] n -= 1 else: nums1[l] = nums1[m-1] m -= 1 l -= 1