[leetcode] 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 index = m + n - 1;
        --m;
        --n;
        while(m >= 0 && n >= 0){
            nums1[index--] = (nums1[m] >= nums2[n])?nums1[m--]:nums2[n--];
        }
        for(int i = n; i >= 0; i--)
            nums1[index--] = nums2[i];
    }
};