88. 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 back = m + n - 1;
		--m; --n;
		while(n >= 0)
		{
			if(nums1[m] > nums2[n] && m >= 0)
			{
				nums1[back--] = nums1[m--];
			}
			else
			{
				nums1[back--] = nums2[n--];
			}
		}
	}	
};