Leetcode 88 Merge Sorted Array
2017-06-22 18:44
267 查看
Leetcode 88 Merge Sorted Array
#include <vector> #include<algorithm> using namespace std; class Solution { public: void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) { if (m == 0){ nums1.assign(nums2.begin(), nums2.end()); return; } if (n == 0) return; vector<int>::iterator it2 = nums2.begin(); for (vector<int>::iterator it = nums1.begin() + m; it != nums1.end(); it++){ *it = *it2; it2++; }//诡异脑回路,反正题目奇怪,nums1已经分配好地方了,所以先全丢进去然后再排序 sort(nums1.begin(), nums1.end()); } };
相关文章推荐
- leetcode 88: Merge Sorted Array
- leetcode 88 Merge Sorted Array
- <LeetCode OJ> Merge Sorted Array【88】
- LeetCode 88:Merge Sorted Array
- Leetcode 88 Merge Sorted Array
- LeetCode88——Merge Sorted Array
- leetcode88---Merge Sorted Array(合并有序数组)
- 【LeetCode-88】Merge Sorted Array(C++)
- 【LeetCode 88 】 Merge Sorted Array
- leetcode 88 Merge Sorted Array
- LeetCode 88 Merge Sorted Array
- 【LEETCODE】88-Merge Sorted Array
- LeetCode4/88 Median of Two Sorted Arrays/Merge Sorted Array
- leetcode-88 Merge Sorted Array
- LeetCode88——Merge Sorted Array
- Leetcode 88 Merge Sorted Array
- leetcode-88-Merge Sorted Array
- 【leetcode】【88】Merge Sorted Array
- LeetCode---(88)Merge Sorted Array
- Leetcode[88]-Merge Sorted Array