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

I don't my solution is very good for this case. But the speed is really fast with only one line of code. Actually the time spent by the function differs because of the sorted function.

func merge(_ nums1: inout [Int], _ m: Int, _ nums2: [Int], _ n: Int) {
	nums1 = (nums1[0..<m] + nums2).sorted()
}

Runtime: 12 ms, faster than 100.00% of Swift online submissions for Merge Sorted Array.
Memory Usage: 19.5 MB, less than 6.90% of Swift online submissions for Merge Sorted Array.