88. Merge Sorted Array

public class Solution {
public void merge(int[] nums1, int m, int[] nums2, int n) {
int[] temp = new int[m+n];
int i=0,j=0,flag=0;
while(j<n&&i<m)
{
while(j<n&&i<m&&nums2[j]<=nums1[i])
temp[flag++] = nums2[j++];
while(i<m&&j<n&&nums1[i]<=nums2[j])
temp[flag++] = nums1[i++];
}
while(i<m)
temp[flag++] = nums1[i++];
while(j<n)
temp[flag++] = nums2[j++];
for(i=0;i<m+n;i++)
nums1[i] = temp[i];
}
}
1ms