双链表的创建、插入、删除与查询 C语言

适合初学者代码

#include<stdio.h>
#include<stdlib.h>

struct node
{
	int data;
	struct node *next;	 
	struct node *prior;
};

typedef struct node *LinkList;

void create(LinkList head,LinkList tail,int n)//尾插法创建
{
	LinkList p;
	int i,a;
	for(i=1;i<=n;i++)
	{
		p=(node *)malloc(sizeof(node));
		scanf("%d",&a);
		p->data=a;
		p->next=NULL;
		tail->next=p;
		p->prior=tail;
		tail=p;
	}
	printf("\n");
}

void insert(LinkList head,LinkList tail,int a,int i)//插入元素
{
	LinkList t,p;
	int j=1;
	p=head->next;
	while(j<i)
	{
		p=p->next;
		j++;
	}
	t=(node *)malloc(sizeof(node));
	t->data=a;
	t->next=p->next;
	p->next->prior=t;
	p->next=t;
	t->prior=p->next->prior;

	t=head->next;
	while(t!=NULL)
	{
		printf("%d ",t->data);
		t=t->next;
	}
	printf("\n");
}

void del(LinkList head,LinkList tail,int i)//删除元素
{
	LinkList p,q;
	p=head->next;
	int j=1;
	while(j<i)
	{
		p=p->next;
		j++;
	}
	q=p->next;
	p->next=q->next;
	q->prior=q->next->prior;
	
	p=head->next;
	while(p!=NULL)
	{
		printf("%d ",p->data);
		p=p->next; 
	 } 
	printf("\n");
}

void check(LinkList head,LinkList tail,int a)//查询元素
{
	LinkList t;
	t=head->next;
	int flag=1;
	while(t!=NULL)
	{
		if(t->data==a)
			flag=0;
		t=t->next;
	}
	if(flag==0)
		printf("有\n");
	else
		printf("无\n");
}


int main(void)
{
	LinkList head,tail;
	tail=head=(node *)malloc(sizeof(node));
	head->prior=NULL;
	head->next=tail;
	int n,a,t,i;
	printf("创建链表输1\n插入输2\n删除输3\n查询输4\n结束输0\n");
	while(1)
	{
		
		scanf("%d",&t);
		if(t==1)
		{
			printf("输入链表长度\n"); 
			scanf("%d",&n);
			create(head,tail,n);
		} 
		
		if(t==2)
		{
			printf("输入插入的元素及位置\n");
			scanf("%d%d",&a,&i);
			insert(head,tail,a,i);
		}
		
		if(t==3)
		{
			printf("输入删除元素的位置\n");
			scanf("%d",&i);
			del(head,tail,i);
		}
		
		if(t==4)
		{
			printf("输入查询的元素\n");
			scanf("%d",&a);
			check(head,tail,a);
		}
		
		if(t==0)
			break;
	}
	return 0;
}
  • 1
    点赞
  • 4
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
以下是双向链表插入删除完整代码示例,包括头插法、尾插法、指定位插入删除等操作: ```c #include <stdio.h> #include <stdlib.h> // 双向链表节点结构体 typedef struct Node { int data; struct Node* prev; struct Node* next; } Node; // 双向链表结构体 typedef struct List { int length; struct Node* head; struct Node* tail; } List; // 初始化双向链表 void initList(List* list) { if (list == NULL) { return; } list->length = 0; list->head = NULL; list->tail = NULL; } // 创建双向链表节点 Node* createNode(int data) { Node* node = (Node*)malloc(sizeof(Node)); if (node == NULL) { return NULL; } node->data = data; node->prev = NULL; node->next = NULL; return node; } // 头插法插入节点 void insertAtHead(List* list, int data) { Node* node = createNode(data); if (list->head == NULL) { list->head = node; list->tail = node; } else { node->next = list->head; list->head->prev = node; list->head = node; } list->length++; } // 尾插法插入节点 void insertAtTail(List* list, int data) { Node* node = createNode(data); if (list->tail == NULL) { list->head = node; list->tail = node; } else { node->prev = list->tail; list->tail->next = node; list->tail = node; } list->length++; } // 在指定位插入节点 void insertAtIndex(List* list, int index, int data) { if (index < 0 || index > list->length) { return; } if (index == 0) { insertAtHead(list, data); return; } if (index == list->length) { insertAtTail(list, data); return; } Node* node = createNode(data); Node* cur = list->head; for (int i = 0; i < index - 1; i++) { cur = cur->next; } node->prev = cur; node->next = cur->next; cur->next->prev = node; cur->next = node; list->length++; } // 删除头节点 void deleteAtHead(List* list) { if (list->head == NULL) { return; } Node* node = list->head; list->head = node->next; if (list->head != NULL) { list->head->prev = NULL; } else { list->tail = NULL; } free(node); list->length--; } // 删除尾节点 void deleteAtTail(List* list) { if (list->tail == NULL) { return; } Node* node = list->tail; list->tail = node->prev; if (list->tail != NULL) { list->tail->next = NULL; } else { list->head = NULL; } free(node); list->length--; } // 删除定位置节点 void deleteAtIndex(List* list, int index) { if (index < 0 || index >= list->length) { return; } if (index == 0) { deleteAtHead(list); return; } if (index == list->length - 1) { deleteAtTail(list); return; } Node* cur = list->head; for (int i = 0; i < index; i++) { cur = cur->next; } cur->prev->next = cur->next; cur->next->prev = cur->prev; free(cur); list->length--; } // 打印双向链表 void printList(List* list) { if (list == NULL || list->head == NULL) { return; } Node* cur = list->head; while (cur != NULL) { printf("%d ", cur->data); cur = cur->next; } printf("\n"); } int main() { List* list = (List*)malloc(sizeof(List)); initList(list); insertAtHead(list, 1); insertAtTail(list, 5); insertAtIndex(list, 1, 3); printList(list); deleteAtHead(list); deleteAtIndex(list, 1); printList(list); free(list); return 0; } ``` 注意:在使用完毕后,需要手动释放双向链表和节点的内存空间,否则会造成内存泄漏。

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值