Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.
class Solution {
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
int i=m,j=n;
nums1.resize(n+m);
while(i>=0 && j>0){
nums1[i+j-1]=(i==0||nums1[i-1]<nums2[j-1])?nums2[--j]:nums1[--i];
}
}
};