[LeetCode]Merge Sorted Array

題目描述:(鏈接)

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

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

解題思路:

class Solution {
public:
    void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
        int i = m;
        int j = 0;
        while (j < n) {
            nums1[i] = nums2[j];
            ++i;
            ++j;
        }
        
        sort(nums1.begin(), nums1.end());
    }
};

?