AlgorithmJourney/LeetCode/LeetCode88.java at main · HenryJi529/AlgorithmJourney · 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
59
60
61
62
63
64
65
66
67
68
69
70
71
import java.util.Arrays;

import util.PrintUtil;

public class LeetCode88 {
    public static void main(String[] args) {
        int[] nums1, nums2;
        int m, n;
        // 输入：nums1 = [1,2,3,0,0,0], m = 3, nums2 = [2,5,6], n = 3
        // 输出：[1,2,2,3,5,6]
        nums1 = new int[] { 1, 2, 3, 0, 0, 0 };
        nums2 = new int[] { 2, 5, 6 };
        m = 3;
        n = 3;
        System.out.println("nums1: " + Arrays.toString(nums1));
        System.out.println("nums2: " + Arrays.toString(nums2));
        new Solution88().merge(nums1, m, nums2, n);
        System.out.println("nums1: " + Arrays.toString(nums1));
        PrintUtil.printDivider();

        // 输入：nums1 = [1], m = 1, nums2 = [], n = 0
        // 输出：[1]
        nums1 = new int[] { 1 };
        nums2 = new int[] {};
        m = 1;
        n = 0;
        System.out.println("nums1: " + Arrays.toString(nums1));
        System.out.println("nums2: " + Arrays.toString(nums2));
        new Solution88().merge(nums1, m, nums2, n);
        System.out.println("nums1: " + Arrays.toString(nums1));
        PrintUtil.printDivider();

        // 输入：nums1 = [0], m = 0, nums2 = [1], n = 1
        // 输出：[1]
        nums1 = new int[] { 0 };
        nums2 = new int[] { 1 };
        m = 0;
        n = 1;
        System.out.println("nums1: " + Arrays.toString(nums1));
        System.out.println("nums2: " + Arrays.toString(nums2));
        new Solution88().merge(nums1, m, nums2, n);
        System.out.println("nums1: " + Arrays.toString(nums1));
        PrintUtil.printDivider();
    }
}

class Solution88 {
    public void merge(int[] nums1, int m, int[] nums2, int n) {
        int p1 = m - 1;
        int p2 = n - 1;
        int p3 = m + n - 1;
        while (p3 >= 0) {
            if (p1 >= 0 && p2 < 0) {
                nums1[p3] = nums1[p1];
                p1--;
            } else if (p1 < 0 && p2 >= 0) {
                nums1[p3] = nums2[p2];
                p2--;
            } else {
                if (nums1[p1] >= nums2[p2]) {
                    nums1[p3] = nums1[p1];
                    p1--;
                } else {
                    nums1[p3] = nums2[p2];
                    p2--;
                }
            }
            p3--;
        }
    }
}