LeetCode题解 -- 双指针(88)

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 enough space (size that is greater or equal to m + n) to hold additional elements from nums2.

时间复杂度:O(M + N)
空间复杂度:O(M + N)

Java方法中参数是值传递方式，如果最后通过nums1 = result这样修改nums1内容，会修改失败

class Solution {
    public void merge(int[] nums1, int m, int[] nums2, int n) {
        int length = nums1.length;
        int[] result = new int[m + n];
        int i = 0;
        int j = 0;
        int temp = 0;
        while(i <= m - 1 && j <= n - 1 && temp <= m + n){
            if(nums1[i] > nums2[j]){
                result[temp++] = nums2[j++];
            }else{
                result[temp++] = nums1[i++];
            }
        }

        while(i <= m - 1){
            result[temp++] = nums1[i++];
        }

        while(j <= n - 1){
            result[temp++] = nums2[j++];
        }

        for(int cur = 0;cur < length;cur++){
            nums1[cur] = result[cur];
        }
    }
}