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 nums1and nums2 are m and n respectively.

思路：类似于插入排序

public class Solution {
public void merge(int[] nums1, int m, int[] nums2, int n) {
if(m==0)
{
for(int k=0;k<n;k++)
nums1[k]=nums2[k];
}

for(int i=0;i<n;i++)
{
int j=m-1+i;

for(;j>=0;j--)
{
if(nums1[j]>nums2[i])
nums1[j+1]=nums1[j];

else break;
}
nums1[j+1]=nums2[i];

}
}
}