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

解题思路:

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

[LeetCode]Merge Sorted Array

原文：http://www.cnblogs.com/skycore/p/4958036.html