Shulou(Shulou.com)06/02 Report--

LeetCode in how to merge two ordered arrays, many novices are not very clear about this, in order to help you solve this problem, the following editor will explain for you in detail, people with this need can come to learn, I hope you can gain something.

Given two ordered integer arrays nums1 and nums2, merge nums2 into nums1 to make nums1 an ordered array. Such as:

two

Answer to the question

Idea: double pointers set two pointers to point to the starting position of the two arrays, compare the size in turn, and put the minimum value into the output array each time. Because you want to create a data storage result or nums1, the minimum space complexity is O (m) and the time complexity is O (m). 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. " I = 0 j = 0 nums3 = nums1 [0 while m] nums1 [:] = [] while I

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.