leetcode 88. Merge Sorted Array

 

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

Note:
You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional elements from nums2. The number of elements initialized in nums1 and nums2 are m and n respectively.

 

 

public class Solution {
    public void merge(int[] nums1, int m, int[] nums2, int n) {
        int[] temp=new int[m+n];
        int k=0;//num1
        int j=0;//num2
        int i=0;//temp
        while (k<m&&j<n){
            if (nums1[k]<nums2[j]){
                temp[i]=nums1[k];
                k++;
                i++;
            }else{
                temp[i]=nums2[j];
                j++;
                i++;
            }
        }
        while (k<m){
            temp[i]=nums1[k];
            k++;
            i++;
        }
        while (j<n){
            temp[i]=nums2[j];
            j++;
            i++;
        }
        for(int ii=0;ii<m+n;ii++){
            nums1[ii]=temp[ii];
        }
    }
}