首页 > itarticle > merge sorted array

merge sorted array

admin 11月 12, 2020 0

题目：
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 {
  public void merge(int[] nums1, m , int[] nums2 , n){
    int i = m - 1;
    int j = n - 1;
    int count = m + n - 1;
    while(i >= 0 && j >= 0){
      count[k--] = (nums1[i] > nums2[j]) ? nums1[i--] : nums2[j--];
    }
    while(j >= 0){		//当nums1[]还没比较完就不用管了，只用考虑nums2[]没比较完的情形
      nums1[count--] = nums2[j--];
    }
  }
}

//方法二：
public class {
  public void merge(int[] nums1,m , int[] nums2 , n){
    System.arraycopy(nums2[] , 0 , nums1[] , m , n); //数组粘合很好用
    Arrays.sort(nums1);	//Arrays.sort()可以记住，挺好用的
  }
}