1,编写一个交错合并列表元素的函数。例如:给定的两个列表为[2,3,4]和[1,2,3],函数返回[2,1,3,2,4,3]
int* f3(int* a1, int* a2, int size1, int size2)
{
int* t = new int[size1 + size2];
for (int i = 0, j = 0; i < size1; ++i)
{
j = 2 * i;
if (j > size2 * 2)//判断a1的长度是否大于a2
{
j = size2 + i;
}
t[j] = a1[i];
}
for (int i = 0, j = 0; i < size2; ++i)
{
j = 2 * i + 1;
if (j > size1 * 2)//判断a2的长度是否大于a1
{
j = size1 + i;
}
t[j] = a2[i];
}
return t;
}