Question

求解释数据结构与算法，要求删除单链表中的相同元素

#include <iostream>
#define TURE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define INFEASIBLE -1
#define OVERFLOW -2
typedef int Status;//Status是函数的类型，其值是函数结果状态代码
typedef int ElemType;//数据元素的类型
typedef struct Lnode
{
ElemType data;
struct Lnode *next;
}Lnode,*LinkList;
Status CreateList_L(LinkList &L,int n)
{
int i;
LinkList p;
L=(LinkList)malloc(sizeof(Lnode));
L->next=NULL;
for (i=n;i>0;--i)
{
p=(LinkList)malloc(sizeof(Lnode));
scanf("%d",&p->data);
p->next=L->next;
L->next=p;
}
return OK;
}
Status ListDelete_Link(LinkList &L)
{
LinkList p=L,follow,q;
while (p)
{
follow=p->next;
q=L->next;
while (q&&p->data!=q->data)
{
q=q->next;
}
}
if(q) free(p);
else {
p->next=L->next;
L->next=p;
}
p=follow;
return OK;
}
Status Tra_Link(LinkList L)
{
LinkList p;
p=L->next;
while (p)
{
printf("%d",p->data);
p=p->next;
}
return OK;
}
void main()
{
int n;
LinkList L;
printf("请输入元素个数:\n");
scanf("%d",&n);
printf("\n请输入单链表中的元素:");
CreateList_L(L,n);
printf("单链表的元素是:\n");
Tra_Link(L);
ListDelete_Link(L);
printf("删除相同元素后的单链表是:");
Tra_Link(L);
}

Answer 1

#include <iostream>
#define TURE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define INFEASIBLE -1
#define OVERFLOW -2
typedef int Status;//Status是函数的类型，其值是函数结果状态代码
typedef int ElemType;//数据元素的类型
typedef struct Lnode
{
ElemType data;
struct Lnode *next;
}Lnode,*LinkList;

Status CreateList_L(LinkList &L,int n)
{
int i;
LinkList p;
L=(LinkList)malloc(sizeof(Lnode));
L->next=NULL;
for (i=n;i>0;--i)
{
p=(LinkList)malloc(sizeof(Lnode));
scanf("%d",&p->data);
p->next=L->next;
L->next=p;
}
return OK;
}
Status ListDelete_Link(LinkList L)
{
int flag;
LinkList t = L->next->next;
LinkList p = NULL;
LinkList s = NULL;
LinkList l = NULL;

L->next->next = NULL;

l = L->next;

while (NULL != t)
{
flag = 1;
p = L->next;

while (NULL != p)
{
if (p->data == t->data)
{
flag = 0;
s = t;
t = t->next;
free(s);
break;
}
p = p->next;
}
if (1 == flag)
{
l->next = t;
l = t;
t = t->next;
l->next = NULL;
}
}

return OK;
}
Status Tra_Link(LinkList L)
{
LinkList p;
p=L->next;
while (p)
{
printf("%d ",p->data);
p=p->next;
}
printf("\n");
return OK;
}
void main()
{
int n;
LinkList L;
printf("请输入元素个数:");
scanf("%d",&n);
printf("\n请输入单链表中的元素:\n");
CreateList_L(L,n);
printf("\n单链表的元素是:\n");
Tra_Link(L);
ListDelete_Link(L);
printf("\n删除相同元素后的单链表是:\n");
Tra_Link(L);
}