88. Merge Sorted Array

Problem:

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.

题意是给定两个排好序的int数组，然后把nums2数组合并进nums1里面。其中第一个数组空间足够，空间大于等于nums1和nums2长度的和。题目很简单，从nums1的m+n-1开始往后循环，元素大的就赋值。

Code：

class Solution {
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
for (int i = m - 1, j = n - 1, target = m + n - 1; j >= 0; target--) {
nums1[target] = i >= 0 && nums1[i] > nums2[j] ? nums1[i--] : nums2[j--];
}
}
};