Leetcode--Java--88. Merge Sorted Array

题目描述

Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.

The number of elements initialized in nums1 and nums2 are m and n respectively. You may assume that nums1 has a size equal to m + n such that it has enough space to hold additional elements from nums2.

样例描述

Example 1:

Input: nums1 = [1,2,3,0,0,0], m = 3, nums2 = [2,5,6], n = 3
Output: [1,2,2,3,5,6]
Example 2:

Input: nums1 = [1], m = 1, nums2 = [], n = 0
Output: [1]
 

Constraints:

nums1.length == m + n
nums2.length == n
0 <= m, n <= 200
1 <= m + n <= 200
-109 <= nums1[i], nums2[i] <= 109

思路

1. 类似归并排序双指针的思路，只不过这里要求不能用额外空间，要放到第一个数组中。如果还是两边指向最小的，会覆盖掉第一个数组中的数。因此可以逆序，两个指针指向最大的数，从后往前填
2. 注意nums2的数可能没有遍历完，要注意扫尾，nums1不需要，因为本身就是存在nums1中的

代码

class Solution {
    public void merge(int[] nums1, int m, int[] nums2, int n) {
       //从后往前找，双指针扫描出比较大的 放在nums1的末尾
       int i = m - 1, j = n - 1, k = m + n - 1;
       while (i >= 0 && j >= 0){
           if (nums1[i] > nums2[j])
               nums1[k --] = nums1[i --];
               else nums1[k --] = nums2[j --];
       }
       //nums2要扫尾 如果没有遍历完
       while (j >= 0)  nums1[k --] = nums2[j --];
    }
}