LeetCode: 88. Merge Sorted Array

友情支持

如果您觉得这个笔记对您有所帮助，看在D瓜哥码这么多字的辛苦上，请友情支持一下，D瓜哥感激不尽，😜

支付宝

有些打赏的朋友希望可以加个好友，欢迎关注D 瓜哥的微信公众号，这样就可以通过公众号的回复直接给我发信息。

wx jikerizhi

公众号的微信号是: jikerizhi。因为众所周知的原因，有时图片加载不出来。如果图片加载不出来可以直接通过搜索微信号来查找我的公众号。

88. Merge Sorted Array

LeetCode - Merge Sorted Array

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]

 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
/**
 * Runtime: 0 ms, faster than 100.00% of Java online submissions for Merge Sorted Array.
 *
 * Memory Usage: 36.5 MB, less than 100.00% of Java online submissions for Merge Sorted Array.
 */
public void merge(int[] nums1, int m, int[] nums2, int n) {
    if (n == 0) {
        return;
    }
    if (m == 0) {
        for (int i = 0; i < n; i++) {
            nums1[i] = nums2[i];
        }
        return;
    }
    int mi = m - 1;
    int ni = n - 1;
    int i = m + n - 1;
    while (mi >= 0 && ni >= 0) {
        if (nums1[mi] > nums2[ni]) {
            nums1[i] = nums1[mi];
            i--;
            mi--;
        } else {
            nums1[i] = nums2[ni];
            i--;
            ni--;
        }
    }
    while (ni >= 0) {
        nums1[i] = nums2[ni];
        i--;
        ni--;
    }
}