Home > Developer > Web Develop
Source files section: #include <stdio.h> #include <string.h> #include <malloc.h>typedef int elemtype; #include " Delist.h "int main () {Dlnode head=null;instruction (head); return 0;} Header file section: typedef struct DLNODE {elemtype data;struct dlnode *prior; The Declaration of the node defines the struct Dlnode *next;} Dlnode,*dlnode;void init_dlist (Dlnode &head)//cyclic bidirectional initialization {head= (dlnode) malloc (sizeof (Dlnode)); head->prior= Head;head->next=head;} int Empty_dlist (Dlnode head)//double-empty {if (head->prior==head&&head->next==head) return 1;return 0;} void Insert_dlist (Dlnode *head,elemtype E)//head interpolation-bidirectional (new) {Dlnode p=null;p= (Dlnode *) malloc (sizeof (Dlnode)); Because it is a two-way loop linked list, there is no bidirectional problem with the IF (!p) {printf ("Sorry, there are not many other memory units being allocated!!! \ n "); return;} p->data=e;p->next=head->next;p->next->prior=p;p->prior=head;//printf ("*%d*\n", Head->next) ; head->next=p;} int Length_dlist (Dlnode head) {dlnode *p=null;int len=0;if (empty_dlist (head)) return 0;p=head->next;while (P!=head) {len++;p =p->next;} return Len;}int delete_dlist (Dlnode *head,elemtype where)//delete by location {Dlnode *p=null;int i=1;p=head->next;if (empty_dlist (head)) { printf ("Sorry, the list is empty and the delete operation cannot be completed!!! \ n "); return 0;} if (where>length_dlist (head) | | where<0) {printf ("Sorry, the location you deleted is not legal, please enter it again!!! \ n "); return 0;} while (I<where) {p=p->next;i++;} p->prior->next=p->prior->next->next;p->prior->next->prior=p->prior;printf ("Delete successful!!! \ n "); return p->data;} void Insearch_dlist (Dlnode head,elemtype E)//Find by Element {Dlnode *p=null;int len=1;if (empty_dlist (head)) {printf ("Sorry, the list is empty , unable to complete the find operation!!! \ n "); return;} P=head->next;while (P!=head) {if (p->data==e) {printf ("the element you are looking for is located in the first%d position of the linked list. \ n", Len); return;} p=p->next;len++;} printf ("Sorry, the element you are looking for does not exist, please enter it again!!! \ n "); return;} void Modify_dlist (Dlnode *head,elemtype where,elemtype e)//change by location {Dlnode *p=null;int len=1;p=head->next;while (len& Lt;where) {p=p->next;len++;} p->data=e;printf ("Change succeeded!\n"); return;} void Print_dlist (Dlnode head)//print operation {Dlnode p=head->next;if (EMpty_dlist (head) {printf ("Sorry, the list is empty and the print operation cannot be completed!!! \ n "); return;} while (head!=p) {printf ("%d", p->data);p =p->next;} printf ("\ n"); return;} void Destory_dlist (Dlnode head)//Destroy empty operation {Dlnode p=head->next;while (p!=head) {p->prior->next=p->next; P->next->prior=p->prior;p=head->next;} printf ("Destruction succeeded!\n");} void instruction (Dlnode head)//function function {int n,m,t,a,b,len1,index;printf ("\t\t1, initial operation \ n");p rintf ("\t\t2, new action \ n"); Why can't I define the head pointer here---because each time the function function is called, the head pointer is again initialized with printf ("\t\t3, delete operation \ n");p rintf ("\t\t4, find operation \ n");p rintf ("\t\ T5, change operation \ n ");p rintf (" \t\t6, destroy operation \ n ");p rintf (" \t\t7, seek long operation \ n ");p rintf (" \t\t8, print operations \ n ");p rintf (" \t\t9, exit program \ n ");p rintf ("Please enter the command you need to complete: \ n");d o{scanf ("%d", &n); if (n<1| | n>9) printf ("Sorry. The instruction number you entered is not valid. Please enter!!! again \ n ");} while (n<1| | N>9); switch (n) {case 1:init_dlist (head); Initialization operation printf ("Completed bidirectional list initialization, enter the number of elements you want to join!\n"), scanf ("%d", &n), while (n--) {int x;scanf ("%d", &x); insert_dlist (head,x);} printf ("Finished building table Operation!\n"); Break;casE 2://New operation if (!head) {printf ("Sorry, please complete the initialization before making the selection!!! \ n "); printf ("Please enter the number of elements you want to add!\n"), scanf ("%d", &n), while (n--) {int x;scanf ("%d", &x); Insert_dlist (head,x);} printf ("Add success!\n"); Break;case 3:printf ("Please enter the location of the node you want to delete: \ n"); scanf ("%d", &n);D elete_dlist (head,n); Delete operation Break;case 4:printf ("Please enter the element you are looking for: \ n"); scanf ("%d", &m); Insearch_dlist (head,m); Find Operation Break;case 5:if (Empty_dlist (head)) {printf ("Sorry, the list is empty and the change operation cannot be completed!!! \ n "); printf ("Please enter the queue location for the element you want to change: \ n"); Change Operation do{scanf ("%d", &a); if (a<1| | A>length_dlist (head)) printf ("Sorry. The element you entered is not in the area, please enter it again!!! \ n ");} while (a<1| | A>length_dlist (head));p rintf ("Please enter the modified value: \ n"); scanf ("%d", &b); Modify_dlist (head,a,b); Break;case 6:destory_dlist (head); Destruction Operation Break;case 7:len1=length_dlist (head); Returns the chain length operation printf ("Current chain queue Length is:%d\n", len1); Break;case 8:print_dlist (head); Print Operation Break;case 9://Exit Operation Return;dEfault:instruction (head); break;} Instruction (head);}
Q=c language &t=blog "target=" _blank ">c language /
Utm_source=blog7 "target=" _blank ">" Live "Machine learning & Data Mining 7 weeks training--Wei Chi
Utm_source=blog7 "target=" _blank ">" Package "System integration project manager Smooth customs clearance--Xu Bong
Start building with 50+ products and up to 12 months usage for Elastic Compute Service
1 on 1 presale consultation
24/7 Technical Support 6 Free Tickets per Quarter Faster Response
Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.
A comprehensive suite of global cloud computing services to power your business
Payment Methods We Support
