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.

题意：合并排序

思想：因为两数组已经是有小到大排好序的，简单的判断合并一下即可

C++ AC代码：Time O(n+m) Space O(n+m)

class Solution {public:    void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {        int m1 = m-1;        int n2 = n-1;        int mn = m+n-1;        while(n2>=0){            nums1[mn--] = (m1>=0 && nums1[m1]>nums2[n2])?nums1[m1--]:nums2[n2--];        }    }};