“`”
参考回答:
<pre><code>class Solution {
public:
void merge(int *num1,int m,int *num2,int n){
int i=m-1;
int j=n-1;
while(i>=0&&j>=0)
{
if(nums1[i]>nums2[j])
{
nums1[i+j+1]=nums1[i];
i–;
}
else{
nums1[i+j+1]=nums2[j];
j–;
}
}
while(j>=0)
{
nums1[i+j+1]=nums[j];
j–;
}
}
};
</code></pre>
<pre><code> "“`
Was this helpful?
0 /
0