西东温的小世界

队列是先进先出,像排队一样 #include<stdio.h>#include<stdlib.h>#define max 100typedef int ElemType; typedef struct { ElemType* data; int front; int rear;}Queue; //初始化Queue* initQueue() { Queue* q = (Queue*)malloc(sizeof(Queue)); q->data = (ElemType*)malloc(sizeof(ElemType)); q->front = 0; q->rear = 0; return q;} //出队ElemType outQueue(Queue* q) { if (q->front == q->rear) { printf(“空的”); return 0; } ElemType e =...

栈是后进先出，像弹夹一样 #include<stdio.h>#include<stdlib.h>#define max 100typedef int ElemType; typedef struct { ElemType data[max]; int top;}Stack; //初始化void initStack(Stack* s) { s->top = -1;} //压栈/进栈int push(Stack* s, ElemType e) { if (s->top >= max - 1) { printf(“满了\n”); return 0; } s->top++; s->data[s->top] = e; return 1;} //出栈int pop(Stack s, ElemType e){ if (s->top == -1) { printf(“空的”); return...

日常生活单词:

#include<stdio.h>#include<stdlib.h>typedef int ElemType; typedef struct node{ ElemType data; struct node *prev, *next; }Node; //初始化双向链表Node* initNode() { Node* head = (Node*)malloc(sizeof(Node)); head->data = 0; head->prev = NULL; head->next = NULL; return head;} //头插法int insertHead(Node* L, ElemType e) { Node* p = (Node*)malloc(sizeof(Node)); p->data = e; p->prev = L; p->next = L->next; if...

#include<stdio.h>#include<stdlib.h>typedef int ElemType;typedef struct node { ElemType data; struct node* next;}Node; Node* initList() { Node* head = (Node*)malloc(sizeof(Node)); head->data = 0; head->next = NULL; return head;} //头插法int insertHead(Node* L, ElemType e)//L为头结点{ Node* p = (Node*)malloc(sizeof(Node)); p->data = e; p->next = L->next; L->next = p; return 1;} //遍历int listNode(Node* L)...

#include<stdio.h>#include<stdlib.h>#define max 100typedef int ElemType; typedef struct { ElemType data; int length;}SeqList;//初始化SeqList initList(){ SeqList* L = (SeqList*)malloc(sizeof(SeqList)); L->data = (ElemType*)malloc(sizeof(ElemType) * max); L->length = 0; return L;} //在尾部添加数据int appendElem(SeqList* L, ElemType e) { if (L->length >= max) { printf(“顺序表已满”); return 0; } ...