C/C++实现双向链表

C++实现双向链表

#include<cstdio> 
#include<cstdlib>
#include<cstring>

struct Node{
	int key;
	Node *next, *prev;
};

Node *nil;

Node* listSearch(int key){
	Node *cur = nil->next; // 从头节后面的元素开始访问 
	while(cur != nil && cur->key != key){
		cur = cur->next;
	}
	return cur;
}

void init(){
	nil = (Node*)malloc(sizeof(Node));
	nil->next = nil;
	nil->prev = nil;
}

void printList(){
	Node *cur = nil->next;
	int isf = 0;
	while(1){
		if(cur == nil) break;
		if(isf++ > 0) printf(" ");
		printf("%d", cur->key);
		cur = cur->next;
	}
	printf("\n");
}

void deleteNode(Node *t){
	if(t == nil) return; // t为头节点时不作处理 
	t->prev->next = t->next;
	t->next->prev = t->prev;
	free(t);
}

void deleteFirst(){
	deleteNode(nil->next);
}

void deleteLast(){
	deleteNode(nil->prev);
}

void deleteKey(int key){
	// 删除搜索到的节点 
	deleteNode(listSearch(key));
}

void insert(int key){
	Node *x = (Node *)malloc(sizeof(Node));
	x->key = key;
	// 在头节点后添加元素 
	x->next = nil->next;
	nil->next->prev = x;
	nil->next = x;
	x->prev = nil;
}

int main(){
	int key, n, i;
	int size = 0;
	char com[20];
	int np = 0, nd = 0;
	scanf("%d", &n);
	init();
	for(i = 0; i < n; i++){
		scanf("%s%d", com, &key); // 使用效率更高的输入函数 
		if(com[0] == 'i'){
			insert(key);
			np++;
			size++;
		}else if(com[0] == 'd'){
			if(strlen(com) > 6){
				if(com[6] = 'F') deleteFirst();
				else if (com[6] == 'L') deleteLast(); 
			}else{
				deleteKey(key); nd++;
			}
			size--;
		}
	}
	printList();
	
	return 0; 
}