数据结构-有序线性表的有序合并(数组实现，简单)

解题思路:基本的合并思路，不知道是不是有序，个人觉得输入应该都是非递减，没必要加sort,但保险起见还是加了。

注意事项:记得循环输入，m==0&&n==0时输出换行。

参考代码:

#include <iostream>

#include <stdlib.h> 

#include <algorithm>

using namespace std;

int main() {

int m = 0, n = 0;

int *a = nullptr;

int *b = nullptr;

int *c = nullptr;

while (cin >> m)

{

a = (int *)malloc(sizeof(int)*m);

for (int i = 0;i < m;i++) {

cin >> a[i];

}

sort(a, a + m);

cin >> n;

b = (int *)malloc(sizeof(int)*n);

for (int i = 0;i < n;i++) {

cin >> b[i];

}

sort(b, b + n);

c = (int *)malloc(sizeof(int)*(m + n));

int ai = 0, bj = 0;

int k = 0;

while (ai < m && bj < n) {

int temp = 0;

if (a[ai] <= b[bj]) {

temp = a[ai];

c[k++] = a[ai++];

}

else {

temp = b[bj];

c[k++] = b[bj++];

}

}

while (ai < m) c[k++] = a[ai++];

while (bj < n) c[k++] = b[bj++];

for (int i = 0;i < k;i++)

cout << c[i] << " ";

if (k == 0)

cout << endl;

}

//system("pause");

return 0;

}