标签：
问题：
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) { multimap<int,int> mm; for(int i=0;i<m;i++) { mm.insert(make_pair(nums1[i],0)); } for(int j=0;j<n;j++) { mm.insert(make_pair(nums2[m+j],0)); } int p=0; multimap <int ,int> iterator :: it; for(it=mm.begin();it=!mm.end();it++) { nums[p++]=it->first; } } };
88. Merge Sorted Array----Array----Easy----20160925
标签：
原文地址：http://www.cnblogs.com/lingyi1111/p/5907688.html
