【Leetcode】88. Merge Sorted Array

Description

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

1
2
3
4
5
6
7
8
9
10
11
12
13
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]

Solution

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
# @param {Integer[]} nums1
# @param {Integer} m
# @param {Integer[]} nums2
# @param {Integer} n
# @return {Void} Do not return anything, modify nums1 in-place instead.
def merge(nums1, m, nums2, n)
return if n == 0

for f in 1..nums1.size
if m >= 1 && nums1[m - 1] > nums2[n - 1]
nums1[nums1.size - f] = nums1[m - 1]
m -= 1
elsif n >= 1
nums1[nums1.size - f] = nums2[n - 1]
n -= 1
end
end
end