88. Merge Sorted Array [easy] (Python)

题目链接

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

题目原文

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

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

题目翻译

给定两个有序整数数组nums1和nums2，将nums2合并到nums1中得到一个有序数组。
注意：假定nums1有足够的空间（其大小大于等于m+n）来存放nums2的元素。nums1和nums2初始时分别有m和n个元素。

思路方法

思路一

既然要合并到nums1中，则从合并后nums1的尾部元素开始，依次向前确定每个元素的值应该是多少。程序需要用到三个指针。

代码