#include <stdio.h>
#include <stdlib.h>
typedef int ElemType;
//定义结点类型
typedef struct Node {
ElemType data; //单链表中的数据域
struct Node *next; //单链表的指针域
}Node,*LinkedList;
//单链表的初始化
LinkedList LinkedListInit() {
Node *L;
L = (Node *)malloc(sizeof(Node)); //申请结点空间
if(L == NULL) { //判断是否有足够的内存空间
printf("申请内存失败\n");
}
L->next = NULL; //将next设置为NULL,初始长度为0的单链表
return L;
}
//单链表的建立1,头插法建立单链表
LinkedList LinkedListCreatH() {
Node *L;
L = (Node *)malloc(sizeof(Node)); //申请头结点空间
L->next = NULL; //初始化一个空链表
ElemType x; //x为链表数据域中的数据
scanf("%d",&x);
while(x != EOF)
{
Node *p;
p = (Node *)malloc(sizeof(Node)); //申请新的结点
p->data = x; //结点数据域赋值
p->next = L->next; //将结点插入到表头L-->|2|-->|1|-->NULL
L->next = p;
scanf("%d",&x);
}
return L;
}
//单链表的建立2,尾插法建立单链表
LinkedList LinkedListCreatT() {
Node *L;
L = (Node *)malloc(sizeof(Node)); //申请头结点空间
L->next = NULL; //初始化一个空链表
Node *r;
r = L; //r始终指向终端结点,开始时指向头结点
ElemType x; //x为链表数据域中的数据
scanf("%d",&x);
while(x != EOF)
{
Node *p;
p = (Node *)malloc(sizeof(Node)); //申请新的结点
p->data = x; //结点数据域赋值
r->next = p; //将结点插入到表尾L-->|1|-->|2|-->NULL
r = p;
scanf("%d",&x);
}
r->next = NULL;
return L;
}
LinkedList Sort_insert(Node *head,Node *p)
{
Node *p1,*p2;
if(head == 0 ) // 空链表,插入链表首结点
{
head = p;
p->next = 0;
return head;
}
if(head->data >= p->data) // 非空链表,插入到链表的首结点
{
p->next = head;
head = p;
return head;
}
p2 = p1 = head;
while(p2->next && p2->data <p->data) // 找到要插入的位置
{
p1 = p2;
p2 = p2->next;
}
if(p2->data < p->data) // 插入链表尾
{
p2->next = p;
p->next = 0;
}
else // 插入在p1和p2所指向的结点之间
{
p->next = p2;
p1->next = p;
}
return head;
}
//有序的单链表的建立
LinkedList LinkedListSort() {
Node *L;
L = (Node *)malloc(sizeof(Node)); //申请头结点空间
L->next = NULL; //初始化一个空链表
ElemType x; //x为链表数据域中的数据
scanf("%d",&x);
while(x != EOF)
{
Node *p;
p = (Node *)malloc(sizeof(Node)); //申请新的结点
p->data = x; //结点数据域赋值
Sort_insert(L,p);
scanf("%d",&x);
}
return L;
}
//单链表的插入,在链表的第i个位置插入x的元素
LinkedList LinkedListInsert(LinkedList L,int i,ElemType x) {
Node *pre; //pre为前驱结点
pre = L;
int tempi = 0;
for (tempi = 1; tempi < i; tempi++) {
pre = pre->next; //查找第i个位置的前驱结点
}
Node *p; //插入的结点为p
p = (Node *)malloc(sizeof(Node));
p->data = x;
p->next = pre->next;
pre->next = p;
return L;
}
//单链表的删除,在链表中删除值为x的元素
LinkedList LinkedListDelete(LinkedList L,ElemType x)
{
Node *p,*pre; //pre为前驱结点,p为查找的结点。
p = L;
while(p->data != x) { //查找值为x的元素
pre = p;
p = p->next;
if(p->next==NULL){
printf("data invalid!");
return L;
}
}
pre->next = p->next; //删除操作,将其前驱next指向其后继。
free(p);
return L;
}
void main() {
LinkedList list,start;
printf(" please enter linklist data:");
list=LinkedListSort();
for(start = list->next; start != NULL; start = start->next) {
printf("%d ",start->data);
}
/* list = LinkedListCreatH();
for(start = list->next; start != NULL; start = start->next) {
printf("%d ",start->data);
}
printf("start\n");
int i;
ElemType x;
printf("please enter insert data option:");
scanf("%d",&i);
printf("please enter insert data:");
scanf("%d",&x);
LinkedListInsert(list,i,x);
for(start = list->next; start != NULL; start = start->next) {
printf("%d ",start->data);
}
printf("\n");
printf("please enter delete data:");
scanf("%d",&x);
LinkedListDelete(list,x);
for(start = list->next; start != NULL; start = start->next) {
printf("%d ",start->data);
} */
printf("over\n");
printf("over\n");
printf("over\n");
printf("over\n");
printf("over\n");
}
#include <stdlib.h>
typedef int ElemType;
//定义结点类型
typedef struct Node {
ElemType data; //单链表中的数据域
struct Node *next; //单链表的指针域
}Node,*LinkedList;
//单链表的初始化
LinkedList LinkedListInit() {
Node *L;
L = (Node *)malloc(sizeof(Node)); //申请结点空间
if(L == NULL) { //判断是否有足够的内存空间
printf("申请内存失败\n");
}
L->next = NULL; //将next设置为NULL,初始长度为0的单链表
return L;
}
//单链表的建立1,头插法建立单链表
LinkedList LinkedListCreatH() {
Node *L;
L = (Node *)malloc(sizeof(Node)); //申请头结点空间
L->next = NULL; //初始化一个空链表
ElemType x; //x为链表数据域中的数据
scanf("%d",&x);
while(x != EOF)
{
Node *p;
p = (Node *)malloc(sizeof(Node)); //申请新的结点
p->data = x; //结点数据域赋值
p->next = L->next; //将结点插入到表头L-->|2|-->|1|-->NULL
L->next = p;
scanf("%d",&x);
}
return L;
}
//单链表的建立2,尾插法建立单链表
LinkedList LinkedListCreatT() {
Node *L;
L = (Node *)malloc(sizeof(Node)); //申请头结点空间
L->next = NULL; //初始化一个空链表
Node *r;
r = L; //r始终指向终端结点,开始时指向头结点
ElemType x; //x为链表数据域中的数据
scanf("%d",&x);
while(x != EOF)
{
Node *p;
p = (Node *)malloc(sizeof(Node)); //申请新的结点
p->data = x; //结点数据域赋值
r->next = p; //将结点插入到表尾L-->|1|-->|2|-->NULL
r = p;
scanf("%d",&x);
}
r->next = NULL;
return L;
}
LinkedList Sort_insert(Node *head,Node *p)
{
Node *p1,*p2;
if(head == 0 ) // 空链表,插入链表首结点
{
head = p;
p->next = 0;
return head;
}
if(head->data >= p->data) // 非空链表,插入到链表的首结点
{
p->next = head;
head = p;
return head;
}
p2 = p1 = head;
while(p2->next && p2->data <p->data) // 找到要插入的位置
{
p1 = p2;
p2 = p2->next;
}
if(p2->data < p->data) // 插入链表尾
{
p2->next = p;
p->next = 0;
}
else // 插入在p1和p2所指向的结点之间
{
p->next = p2;
p1->next = p;
}
return head;
}
//有序的单链表的建立
LinkedList LinkedListSort() {
Node *L;
L = (Node *)malloc(sizeof(Node)); //申请头结点空间
L->next = NULL; //初始化一个空链表
ElemType x; //x为链表数据域中的数据
scanf("%d",&x);
while(x != EOF)
{
Node *p;
p = (Node *)malloc(sizeof(Node)); //申请新的结点
p->data = x; //结点数据域赋值
Sort_insert(L,p);
scanf("%d",&x);
}
return L;
}
//单链表的插入,在链表的第i个位置插入x的元素
LinkedList LinkedListInsert(LinkedList L,int i,ElemType x) {
Node *pre; //pre为前驱结点
pre = L;
int tempi = 0;
for (tempi = 1; tempi < i; tempi++) {
pre = pre->next; //查找第i个位置的前驱结点
}
Node *p; //插入的结点为p
p = (Node *)malloc(sizeof(Node));
p->data = x;
p->next = pre->next;
pre->next = p;
return L;
}
//单链表的删除,在链表中删除值为x的元素
LinkedList LinkedListDelete(LinkedList L,ElemType x)
{
Node *p,*pre; //pre为前驱结点,p为查找的结点。
p = L;
while(p->data != x) { //查找值为x的元素
pre = p;
p = p->next;
if(p->next==NULL){
printf("data invalid!");
return L;
}
}
pre->next = p->next; //删除操作,将其前驱next指向其后继。
free(p);
return L;
}
void main() {
LinkedList list,start;
printf(" please enter linklist data:");
list=LinkedListSort();
for(start = list->next; start != NULL; start = start->next) {
printf("%d ",start->data);
}
/* list = LinkedListCreatH();
for(start = list->next; start != NULL; start = start->next) {
printf("%d ",start->data);
}
printf("start\n");
int i;
ElemType x;
printf("please enter insert data option:");
scanf("%d",&i);
printf("please enter insert data:");
scanf("%d",&x);
LinkedListInsert(list,i,x);
for(start = list->next; start != NULL; start = start->next) {
printf("%d ",start->data);
}
printf("\n");
printf("please enter delete data:");
scanf("%d",&x);
LinkedListDelete(list,x);
for(start = list->next; start != NULL; start = start->next) {
printf("%d ",start->data);
} */
printf("over\n");
printf("over\n");
printf("over\n");
printf("over\n");
printf("over\n");
}