[Leetcode] 88. Merge Sorted Array Java

Topic:

Given sorted integer Arrays nums1 and nums2, merge nums2 into nums1 as one sorted Array.

Note:
Assume that nums1 have enough space (size that's greater or equal to m + n) to hold Additional elements from Nums2. The number of elements initialized in nums1 and nums2 is m and n respectively .

test instructions and analysis: an ordered array, nums1 and NUMS2, is added to the array a by combining the number of the first m and the first n of the NUMS2 in the nums1. The first idea is to use an array C to save the result, then assign C A, but this uses extra space, which can be compared back and forth so that the space of array A can be reused without using an extra array of C.

Code:

classSolution { Public voidMergeint[] nums1,intMint[] Nums2,intN) {intK = m+n-1; inti = m-1,j=n-1;  while(i>=0&&j>=0){            if(nums1[i]<Nums2[j]) {Nums1[k]=Nums2[j]; J--; }Else{Nums1[k]=Nums1[i]; I--; } k--; }         while(i>=0) {Nums1[k]=Nums1[i]; I--; K--; }         while(j>=0) {Nums1[k]=Nums2[j]; J--; K--; }    }}

[Leetcode] 88. Merge Sorted Array Java