88. 合并两个有序数组

  1. public void merge(int[] nums1, int m, int[] nums2, int n) {
  2.          // two get pointers for nums1 and nums2
  3.         int p1 = m - 1;
  4.         int p2 = n - 1;
  5.         // set pointer for nums1
  6.         int p = m + n - 1;
  8.         // while there are still elements to compare
  9.         while ((p1 >= 0) && (p2 >= 0))
  10.         // compare two elements from nums1 and nums2 
  11.         // and add the largest one in nums1 
  12.         nums1[p--] = (nums1[p1] < nums2[p2]) ? nums2[p2--] : nums1[p1--];
  13.         // add missing elements from nums2
  14.         System.arraycopy(nums2, 0, nums1, 0, p2 + 1);///上面减1了，移动元素的个数。
  16. // 作者：LeetCode
  17. // 链接：https://leetcode-cn.com/problems/merge-sorted-array/solution/he-bing-liang-ge-you-xu-shu-zu-by-leetcode/
  19.     }
  1. System.arraycopy(nums2, 0, nums1, m, n);//移动元素的个数
  2. Arrays.sort(nums1);