?? linkedlist.cpp
字號:
#include <stdio.h>#define NODE_NUM 10struct node{int data;node *prev;node *next;};node *head=NULL;void print_linkedlist(node *head, int node_num){int i;node *temp=head;for(i=0; i<node_num; i++, temp=temp->next){ printf("The data of current node: %d\n", temp->data);}}void reverse_print_linkedlist(node *tail, int node_num){int i;node *temp=tail;for(i=0; i<node_num; i++, temp=temp->prev){ printf("The data of current node: %d\n", temp->data);}}void print_node(node *nd){printf("The value of node %d\n", nd->data);}void init(int node_num){int i;node *tail=NULL;node *current=NULL;for(i=0; i<node_num; i++){node *newnode= new node();if(i == 0){ head=newnode; current=newnode; newnode->data=i; continue;}newnode->data=i;newnode->prev=current;current->next=newnode;current=newnode;if(i == node_num-1){head->prev=newnode;newnode->next=head;tail=newnode;}print_node(current);}print_linkedlist(head, node_num);reverse_print_linkedlist(tail, node_num);}/*Insert a node after the value-specified node*/void insert_node(node *nd, int data){node *newnode = new node();newnode->data=data;nd->next->prev=newnode;newnode->next=nd->next;nd->next=newnode;newnode->prev=nd;print_linkedlist(head, NODE_NUM+4);}/*Delete a value-specified node*/void delete_node(int data){int i;node *temp=head;for(i=0; i<NODE_NUM; i++, temp=temp->next) if(temp->data == data) { temp->prev->next=temp->next; temp->next->prev=temp->prev; delete temp; }print_linkedlist(head, NODE_NUM);}int main(){init(NODE_NUM);insert_node(head->next->next, 28);delete_node(7);}?? 快捷鍵說明
復(fù)制代碼
Ctrl + C
搜索代碼
Ctrl + F
全屏模式
F11
切換主題
Ctrl + Shift + D
顯示快捷鍵
?
增大字號
Ctrl + =
減小字號
Ctrl + -