Leectode 88. 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]

tag: array, two pointers

method 1

O(1) 空间复杂度的方法，两根指针法

如果从前往后进行排序，那么要将后面的点依次往后排，如果从后往前排，就能解决这个问题

public void merge(int[] nums1, int m, int[] nums2, int n) {
        int left = m-1;
        int right = n-1;

        for (int i = m+n-1; i >= 0 && left>= 0 && right >= 0; i--) {
            if (nums1[left] > nums2[right]){
                nums1[i] = nums1[left];
                left--;
            }else {
                nums1[i] = nums2[right];
                right--;
            }
        }

        if (right >= 0){
            for (int i = right; i >= 0; i--) {
                nums1[i] = nums2[i];
            }
        }

        System.out.println(Arrays.toString(nums1));
    }

summary:

1. 在和array、有序相关的问题背景下，如果正向遍历难度比较大，可以反向思维，考虑反向遍历