88. 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.

Example 1:

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

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

Example 2:

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

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

解法1：逆序复制

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
class Solution {
public:
    void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
        int i = m - 1, j = n - 1, k = m + n - 1;
        while(i >= 0 && j>= 0){
            if(nums2[j] >= nums1[i]){
                nums1[k--] = nums2[j--];
            }else{
                nums1[k--] = nums1[i--];
            }
        }
        while(j>=0){
            nums1[k--] = nums2[j--];
        }
    }
};

相关题目