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.
Subscribe to see which companies asked this question.
class Solution {
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
if (n == 0)
return;
int all = m+n-1;
m--;
n--;
while(m >=0 && n >=0)
nums1[all--] = (nums1[m]> nums2[n])? nums1[m--]:nums2[n--];//条件执行语句,m--只在被调用是执行
while(n >= 0)//当nums2中还有数时
{
nums1[all--] = nums2[n--];
}
}
};
合并两个数组 nums2 就直接补呗 nums1[all--] = nums2[n--];