leetcode題記:Merge Sorted Array

程式設計語言：JAVA

題目描述：

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 = [,,,,,], m = 
nums2 = [,,],       n = 

Output: [,,,,,]
           

送出回報：

/  test cases passed.
Status: Accepted
Runtime:  ms
Submitted:  minutes ago
You are here! 
Your runtime beats  % of java submissions.
           

解題思路：

為了不占用額外空間，倒着比較。最大的放在最後。循環結束條件為其中一個數組比較完成。while循環控制多個條件。
           

代碼：

class Solution {
    public void merge(int[] nums1, int m, int[] nums2, int n) {
        int i = m-;
        int j = n-;
        int k = m+n-;
        while(i >=  && j>=){
            if(nums1[i] > nums2[j]){
                nums1[k] = nums1[i];
                i -= ;
            }
            else{
                nums1[k] = nums2[j];
                j -= ;
            }
            k -= ;
        }

        while(j >= ){
            nums1[j] = nums2[j];
            j -= ;
        }
    }
}