#Leetcode# 88. Merge Sorted Array

标签：init   spec   script   merge   nbsp   sorted   amp   and   into   

https://leetcode.com/problems/merge-sorted-array/description/

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:

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(vector<int>& nums1, int m, vector<int>& nums2, int n) {
        int cnt = m + n;
        int A[cnt];
        for(int i = 0; i < m; i ++) 
            A[i] = nums1[i];
        for(int i = m; i < m + n; i ++)
            A[i] = nums2[i - m];
        sort(A, A + n + m);
        for(int i = 0; i < cnt; i ++) {
            nums1[i] = A[i];
        }
    }
};

#Leetcode# 88. Merge Sorted Array

标签：init   spec   script   merge   nbsp   sorted   amp   and   into   

原文地址：https://www.cnblogs.com/zlrrrr/p/9924573.html