// ConsoleApplication3.cpp : 定义控制台应用程序的入口点。
//
#include "stdafx.h" //A,B分别有序,打印出属于A,不属于的B的元素保存在A中。
#include<stdlib.h>
typedef struct LNode
{
int data;
struct LNode* next;
}LNode;
LNode* creat( int a[], int n)
{
LNode *A, *B;
LNode *r;
A = (LNode*)malloc(sizeof(LNode));
A->next = NULL;
r = A;
for (int i = 0; i <= n; i++)
{
LNode*s = (LNode*)malloc(sizeof(LNode));
s->data = a[i];
r->next = s;
r = r->next;
}
r->next = NULL;
printf("\n");
return A;
}
LNode*minus(LNode*A, LNode*B )
{
LNode*p = A->next;
LNode*q = B->next;
LNode*pre = A; //定义一个始终指在P前面的指针
while (p!=NULL&&q!=NULL)
{
if (p->data < q->data)
{
pre=p;
p = p->next;
}
else if (p->data > q->data)
{
q = q->next;
}
else
{
pre ->next=p->next; //删除
p = p->next;
}
}
return A;
}
void print(LNode *L) //输出新链表
{
L = L->next;
while (L != NULL)
{
printf("%d ", L->data);
L = L->next;
}
printf("\n");
}
int _tmain(int argc, _TCHAR* argv[])
{
LNode*A, *B;
int a[8] = {1,2,3,4,5,7};
int b[8] = { 3,4,5,7,9,11 };
A = creat(a, 5);
B = creat(b, 5);
print(minus(A, B));
system("pause");
}
//
#include "stdafx.h" //A,B分别有序,打印出属于A,不属于的B的元素保存在A中。
#include<stdlib.h>
typedef struct LNode
{
int data;
struct LNode* next;
}LNode;
LNode* creat( int a[], int n)
{
LNode *A, *B;
LNode *r;
A = (LNode*)malloc(sizeof(LNode));
A->next = NULL;
r = A;
for (int i = 0; i <= n; i++)
{
LNode*s = (LNode*)malloc(sizeof(LNode));
s->data = a[i];
r->next = s;
r = r->next;
}
r->next = NULL;
printf("\n");
return A;
}
LNode*minus(LNode*A, LNode*B )
{
LNode*p = A->next;
LNode*q = B->next;
LNode*pre = A; //定义一个始终指在P前面的指针
while (p!=NULL&&q!=NULL)
{
if (p->data < q->data)
{
pre=p;
p = p->next;
}
else if (p->data > q->data)
{
q = q->next;
}
else
{
pre ->next=p->next; //删除
p = p->next;
}
}
return A;
}
void print(LNode *L) //输出新链表
{
L = L->next;
while (L != NULL)
{
printf("%d ", L->data);
L = L->next;
}
printf("\n");
}
int _tmain(int argc, _TCHAR* argv[])
{
LNode*A, *B;
int a[8] = {1,2,3,4,5,7};
int b[8] = { 3,4,5,7,9,11 };
A = creat(a, 5);
B = creat(b, 5);
print(minus(A, B));
system("pause");
}