-
Notifications
You must be signed in to change notification settings - Fork 0
/
088MergeSortedArray.swift
37 lines (34 loc) · 1.71 KB
/
088MergeSortedArray.swift
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
/*
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 = [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.
*/
struct Solution {
static func merge(_ nums1: inout [Int], _ m: Int, _ nums2: [Int], _ n: Int) {
nums1.removeLast(n)
for num2 in nums2 {
guard !nums1.isEmpty else {
nums1.append(num2)
continue
}
if let num1Index = nums1.lastIndex(where: { $0 < num2 }) {
nums1.insert(num2, at: num1Index + 1)
} else if let num1Index = nums1.lastIndex(where: { $0 == num2 }) {
nums1.insert(num2, at: num1Index + 1)
} else if num2 < nums1.first ?? 0 {
nums1.insert(num2, at: 0)
}
}
}
}