清华考研第二弹———用头节点定义的链表实现的各种操作
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
using namespace std;
typedef struct Linklist {
int data;
struct Linklist* next;
}Linklist, * Link;
bool EmptyList(Linklist *l) {
if (l->next == NULL)
{
cout << "这是一个空链表" <<endl;
return true;
}
else {
cout<< "这不是空链表"<<endl;
return false;
}
}
Link InitList(Link l) {
l = (Linklist*)malloc(sizeof(Linklist));
l->next = NULL;
EmptyList(l);
if (EmptyList(l) == true) {
cout << "初始化成功!"<<endl;
}
return l;
}
int InsertList(Link l, int x) {
Link q = (Link)malloc(sizeof(Linklist));
if(q==NULL){
return -1;
}
q->data = x;
q->next = NULL;
q->next=l->next;
l->next=q;
return 1;
}
void InsertList2(Link l, int pos,int x){
Link s = (Link)malloc(sizeof(Linklist));
s->data=x;
Link p=l;
int j=0;
while(p&&j<pos-1){
p=p->next;
j++;
}
s->next=p->next;
p->next=s;
}
void ViewList(Linklist *l) {
Link q=l->next;
while(q){
cout<<q->data<<endl;
q=q->next;
}
}
int SelectList(Link l,int i){
Link q=l->next;
int j=1;
int k=0;
while(q!=NULL&&j<i){
q=q->next;
j++ ;
}
k=q->data;
return k;
}
int DeleteList2(Link l, int pos){
Link p=l;
Link q;
int j=0;
while(p->next&&j<pos-1){
p=p->next;
j++;
}
q=p->next;
int x=q->data;
p->next=q->next;
free(q);
return x;
}
int main() {
Linklist *l;
int j=0;
l=InitList(l);
InsertList(l,6);
InsertList(l,3);
InsertList(l,4);
InsertList(l,1);
InsertList2(l,2,5);
InsertList2(l,2,5);
ViewList(l);
j=DeleteList2(l,4);
cout<<"删除的元素的值"<<j<<endl;
cout<<"删除后的链表为"<<endl;
ViewList(l);
}