Leetcode-88. Merge Sorted Array

地址：https://leetcode.com/problems/merge-sorted-array/

描述：

Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.

Note:

• The number of elements initialized in nums1 and nums2 are m and n respectively.
• You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional elements from nums2.

实例：

Input:
nums1 = [1,2,3,0,0,0], m = 3
nums2 = [2,5,6],       n = 3

Output: [1,2,2,3,5,6]

方法：

 public int[] merge_4(int[] nums1, int m, int[] nums2, int n){
        while(n>0){
            nums1[m+n-1]=(m==0||nums2[n-1]>nums1[m-1])?nums2[--n]:nums1[--m];}
        return nums1;
    }

 

转载于:https://www.cnblogs.com/zimengfang/p/10798224.html