88. Merge Sorted Array
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]
解题思路:
使用插入排序的方法,将 nums2 中每个元素插入到 nums1 中
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 anything, modify nums1 in-place instead.
"""
# index = 0
i, j = 0, 0
for i in range(n):
if nums2[i] < nums1[m-1]:
# temp = nums2[i]
j = m - 1
while j >= 0 and nums2[i] < nums1[j]:
# print(nums1)
nums1[j+1] = nums1[j]
j -= 1
nums1[j+1] = nums2[i]
else:
nums1[m] = nums2[i]
m += 1
return nums1
发现一个优化的方法
请多多指教。
文章标题:88. Merge Sorted Array
本文作者:顺强
发布时间:2019-04-26, 23:59:00
原始链接:http://shunqiang.ml/leetcode-88-merge-sorted-array/版权声明: "署名-非商用-相同方式共享 4.0" 转载请保留原文链接及作者。