题目:https://leetcode.com/problems/merge-sorted-array/description/
代码:
class Solution {
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
int i=m-1,j=n-1,k=m+n-1;
while(j>=0){
if(nums1[i]>nums2[j]&&i>=0){
nums1[k--]=nums1[i--];
}else{
nums1[k--]=nums2[j--];
}
}
}
};