Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.
Note:
Example:
Input: nums1 = [1,2,3,0,0,0], m = 3 nums2 = [2,5,6], n = 3 Output: [1,2,2,3,5,6]
class Solution { public void merge(int[] A, int m, int[] B, int n) { int i = m - 1, j = n - 1, k = m + n - 1; while(i>=0 && j>=0) A[k--] = (A[i]>B[j]) ? A[i--] : B[j--]; while(j>=0) A[k--] = B[j--]; } }
88. Merge Sorted Array【Easy】【双指针-不用额外空间归并两个有序数组】
原文：https://www.cnblogs.com/Roni-i/p/10427472.html