将两个有序数组连接成为一个数组并且对其进行排序

#include
#include
using namespace std;
class Solution {
public:
void merge(vector& nums1, int m, vector& nums2, int n) {
if (m == 0 && n == 0)
return;
int len = m + n-1;
m = m - 1;
n = n - 1;
while (m >= 0 && n >= 0)
{
if (nums1[m] >= nums2[n])
{
nums1[len] = nums1[m];
m–;
}
else if(nums1[m]<nums2[n]) {
nums1[len] = nums2[n];
n–;
}
len–;
}
while (n >= 0)
{
nums1[len] = nums2[n];
len–;
n–;
}
}
};

int main(void)
{
int n = 0;
int m = 0;
cout << "please enter the length str1: ";
cin >> m;
cout << "please enter the length str2: ";
cin >> n;
cout << "please enter the global str1: ";
vectornums1(m + n);
for (int i = 0;i < m;i++)
{
cin >> nums1[i];
}
cout << "please enter the global of str2: “;
vectornums2(n);
for (int i = 0;i < n;i++)
{
cin >> nums2[i];
}
Solution s;
s.merge(nums1, m, nums2, n);
for(int a: nums1)
{
cout << a<<” ";
}
return 0;
}