题目:
首先看看代码:
#include<stdio.h>
#include<stdlib.h>
#define N 100
typedef struct SequeceList
{
int a[N];
int size;
}SL;
void MergeOperation(SL* inputA, SL* inputB)
{
SL Output;
SL* output = &Output;
output->size = inputA->size + inputB->size;
int i = 0;
int j = 0;
int k = 0;
while (i < inputA->size && j < inputB->size)
{
if (inputA->a[i] < inputB->a[j])
{
output->a[k] = inputA->a[i];
i++;
k++;
}
else
{
output->a[k] = inputB->a[j];
j++;
k++;
}
}
while (i < inputA->size)
{
output->a[k] = inputA->a[i];
i++;
k++;
}
while (j < inputB->size)
{
output->a[k] = inputB->a[j];
j++;
k++;
}
for (k = 0; k < output->size; k++)
{
printf("%d ", output->a[k]);
}
}
int main()
{
SL InputA, InputB;
int i = 0;
int n = 0;
int m = 0;
scanf("%d", &n);
InputA.size = n;
for (i = 0; i < n; i++)
{
scanf("%d", &InputA.a[i]);
}
scanf("%d", &m);
InputB.size = m;
for (i = 0; i < m; i++)
{
scanf("%d", &InputB.a[i]);
}
MergeOperation(&InputA, &InputB);
return 0;
}
解析此题:
首先需要建立结构体:
然后在main函数中建立此题思路:
对此题的看法:首先这个IO型的题目大家做起来肯定很难受,测试用例太少,描述也不太清晰,再其次这样的静态顺序表在实际中似乎真的用处不大,不过作为一道题大家还是好好研究