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.

---

思路：
本题比较简单，把两个有序数组合并成一个有序数组。从数组的后端开始操作，只需要 O(m+n) 的时间复杂度。注意i 和j 的边界处理。

---

C++代码如下：

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