1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116
|
#include <stdio.h> #include <stdlib.h>
#define TRUE 1 #define FALSE 0
typedef struct Node { int data; struct Node* next; }Node;
Node* initList() { Node* L = (Node*)malloc(sizeof(Node)); L -> data = 0; L -> next = L; return L; }
void headInsert(Node* L, int data) { Node* node = (Node*)malloc(sizeof(Node)); node -> data = data; node -> next = L -> next; L -> next = node; L -> data ++; }
void tailInsert(Node* L, int data) { Node* n = L; Node* node = (Node*)malloc(sizeof(Node)); node -> data = data; while(n -> next != L){ n = n -> next; } node -> next = L; n -> next = node; L -> data ++; }
int delete(Node* L, int data) { Node* preNode = L; Node* node = L -> next; while(node != L){ if(node -> data == data){ preNode -> next = node -> next; free(node); L -> data --; return TRUE; } preNode = node; node = node -> next; } return FALSE; }
void printList(Node* L) { Node* node = L -> next; while(node != L){ printf("%d->", node -> data); node = node -> next; } printf("NULL\n"); }
int main() { Node* L = initList(); headInsert(L, 1); headInsert(L, 2); headInsert(L, 3); headInsert(L, 4); headInsert(L, 5); tailInsert(L, 6); tailInsert(L, 7); printList(L); delete(L, 4); delete(L, 7); printList(L); return 0; }
|