coding-challenges/Leetcode - Merge Sorted Array.py at main · momeraffan/coding-challenges · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
### You are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n,
### representing the number of elements in nums1 and nums2 respectively.

### Merge nums1 and nums2 into a single array sorted in non-decreasing order.

### The final sorted array should not be returned by the function, but instead be stored inside the array nums1.
###To accommodate this, nums1 has a length of m + n, where the first m elements denote the elements that should be merged,
### and the last n elements are set to 0 and should be ignored. nums2 has a length of n.

### Example 1:
### Input: nums1 = [1,2,3,0,0,0], m = 3, nums2 = [2,5,6], n = 3
### Output: [1,2,2,3,5,6]
### Explanation: The arrays we are merging are [1,2,3] and [2,5,6].
### The result of the merge is [1,2,2,3,5,6] with the underlined elements coming from nums1.

### Example 2:
### Input: nums1 = [1], m = 1, nums2 = [], n = 0
### Output: [1]
### Explanation: The arrays we are merging are [1] and [].
### The result of the merge is [1].

### Example 3:
### Input: nums1 = [0], m = 0, nums2 = [1], n = 1
### Output: [1]
### Explanation: The arrays we are merging are [] and [1].
### The result of the merge is [1].
### Note that because m = 0, there are no elements in nums1. The 0 is only there to ensure the merge result can fit in nums1.


### Constraints:
### nums1.length == m + n
### nums2.length == n
### 0 <= m, n <= 200
### 1 <= m + n <= 200
### -109 <= nums1[i], nums2[j] <= 109


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.
        """
        if m == 0 and n>0:
            nums2.sort()
            for x in range(len(nums1)):
                nums1[x] = nums2[x]
        elif n == 0 and m>0:
            nums1.sort()
        else:
            nums = nums1[0:m]
            nums = nums+nums2
            nums.sort()
            for x in range(len(nums)):
                nums1[x] = nums[x]


# Runtime: 43 ms, faster than 73.02% of Python3 online submissions for Merge Sorted Array.
# Memory Usage: 13.9 MB, less than 85.88% of Python3 online submissions for Merge Sorted Array.