数据结构
小杰博客
这个作者很懒,什么都没留下…
展开
-
SeqList.h (顺序表及其简单应用)
<br />SeqList.h<br />//顺序表的实现#include "stdio.h"#include "math.h"//#define MaxSize 10//typedef int DataType;typedef struct { DataType list[MaxSize]; int size;} SeqList;//初始化列表void ListInitiate(SeqList *L){ L->size = 0;}//得原创 2011-04-23 15:51:00 · 10651 阅读 · 0 评论 -
数据结构之SeqStack---堆栈应用---括号匹配问题
<br />SeqStack.h<br />#include "stdio.h"#include "math.h"typedef struct { DataType stack [MaxStackSize]; int top;} SeqStack;void StackInitiate(SeqStack *S){ S->top = 0;}int StackNotEmpty(SeqStack *S){ if (S->top <= 0) {原创 2011-04-24 19:47:00 · 1891 阅读 · 0 评论 -
LinList.h (线性表的链式表示方法及简单应用)
<br />LinList.h<br />//单链表,线性表的链式表示#include "stdio.h"#include "math.h"typedef struct Node{ DataType data; struct Node *next;} SLNode;void ListInitiate(SLNode **head){ if (( *head = (SLNode *)malloc(sizeof(SLNode))) == NULL ) exit(1)原创 2011-04-23 17:09:00 · 2511 阅读 · 0 评论 -
LinStack.h (栈堆的链式表示及简单应用)
<br />LinStack.h<br />// 堆栈的链式表示#include "stdio.h"#include "stdlib.h"typedef struct snode{ DataType data; struct snode *next;} LSNode;void StackInitiate(LSNode ** head){ if (( *head = (LSNode *)malloc(sizeof(LSNode))) == 0 ) exit(1);原创 2011-04-24 16:55:00 · 1193 阅读 · 0 评论 -
SeqStack.h (顺序栈及简单应用)
<br />SeqStack.h<br />#include "stdio.h"#include "math.h"typedef struct { DataType stack [MaxStackSize]; int top;} SeqStack;void StackInitiate(SeqStack *S){ S->top = 0;}int StackNotEmpty(SeqStack *S){ if (S->top <= 0) {原创 2011-04-24 16:07:00 · 9588 阅读 · 0 评论 -
LQueue.h 链式队列,不循环
<br />//LQueue.h 链式队列,不循环#include "stdio.h"typedef struct qnode{ DataType data; struct qnode *next;} LQNode;typedef struct{ LQNode * front; LQNode * rear;} LQueue;void QueueInitiate(LQueue * Q){ Q->rear = NUL原创 2011-04-27 15:35:00 · 922 阅读 · 0 评论 -
回文字(堆栈和队列实现)
<br />HuiWen.cpp<br />#include "stdio.h"#include "string.h"#define MaxQueueSize 100#define MaxStackSize 100typedef char DataType;#include "SeqCQueue.h"#include "SeqStack.h"void HuiWen(char str[]){ SeqCQueue myQueue; SeqStack myS原创 2011-04-27 18:36:00 · 627 阅读 · 0 评论 -
SeqCQueue.h 顺序循环队列
<br />#include "stdio.h"#include "string.h"typedef struct { DataType queue[MaxQueueSize]; int rear; int front; int count;} SeqCQueue;void QueueInitiate(SeqCQueue * Q){ Q->rear = 0; Q->front = 0; Q->count = 0;}原创 2011-04-27 15:36:00 · 1285 阅读 · 0 评论