#include <iostream>
using namespace std;
typedef struct
{
int data[100];
int length;
}SqList;
void diffence(SqList A, SqList B,SqList &C)
{
int i = 0, j = 0, k = 0;
while (i < A.length&&j < B.length)
{
if (A.data[i] < B.data[j])
{
C.data[k] = A.data[i];
i++; k++;
}
else if (A.data[i]>B.data[j]) j++;
else
{
j++; k++;
}
}
while (i < A.length)
{
C.data[k] = A.data[i];
i++; k++;
}
C.length = k;
using namespace std;
typedef struct
{
int data[100];
int length;
}SqList;
void diffence(SqList A, SqList B,SqList &C)
{
int i = 0, j = 0, k = 0;
while (i < A.length&&j < B.length)
{
if (A.data[i] < B.data[j])
{
C.data[k] = A.data[i];
i++; k++;
}
else if (A.data[i]>B.data[j]) j++;
else
{
j++; k++;
}
}
while (i < A.length)
{
C.data[k] = A.data[i];
i++; k++;
}
C.length = k;
}
复杂度为O(m+n)。