C++/C
[email protected]
Programmer(){
practice();
record();
think();}
展开
-
栈的运用之表达式(C++/C)
栈的运用之表达式(C++/C)1.关键函数bool bracketCheck(SeqStack &S,ElemType str[],int length){ for (int i = 0; i <length ; i++) { if (str[i]=='('||str[i]=='['||str[i]=='{'){ Push(S,str[i]); } else{ if (isStackEm..原创 2020-10-15 00:46:00 · 281 阅读 · 0 评论 -
队列(Queue)之顺序表和链表(C++/C)
队列(Queue)之顺序表和链表(C++/C)1.基本操作//初始化void InitQueue(SqQueue &Q)//判断队列是否为空bool isQueueEmpty(SqQueue Q)//判断是否队满bool isQueeuFull(SqQueue Q)//入队bool EnQueue(SqQueue &Q,ElemType x)//出队bool DeQueue(SqQueue &Q,ElemType &x)..原创 2020-10-14 23:45:29 · 1197 阅读 · 0 评论 -
栈(Stack)的顺序表和链表存储(C++/C)
栈(Stack)的顺序表和链表存储(C++/C)1.基本操作2.顺序存储1.运行结果2.源代码#include<stdio.h>#include <stdlib.h>#define ElemType int#define MaxSize 50typedef struct { ElemType data[MaxSize]; int top;}SeqStack;//初始化void InitStack(SeqStack..原创 2020-10-13 21:54:21 · 536 阅读 · 0 评论 -
线性表之链表之循环链表(C++/C)
线性表之链表之循环链表(C++/C)1.循环单链表#include<stdio.h>#include <stdlib.h>#define ElemType inttypedef struct LNode{ ElemType data; struct LNode *next;}LNode,*LinkList;//初始化一个循环单链表bool InitList(LinkList &L){ L=(LNode*)malloc(.原创 2020-10-12 11:44:50 · 135 阅读 · 0 评论 -
线性表之双链表(C++/C)
线性表之双链表(C++/C)1.基本操作注:双链表带头结点声明:#include <stdio.h>#include <stdlib.h>//双链表 带头节点#define ElemType inttypedef struct DNode{ ElemType data; struct DNode*prior,*next;}DNode,*DLinkList;//初始化双链表bool InitDLink(DLinkLis..原创 2020-10-12 00:44:12 · 158 阅读 · 0 评论 -
线性表之单链表(C++/C)
线性表之单链表(C++/C)1 基本操作声明部分:#include <cstdlib>#include "stdio.h"#define ElemType inttypedef struct LNode{ ElemType data; struct LNode *next;}LNode,*LinkList;1.//初始化单链表//不带头结点的单链表bool InitList(LinkList &L)//初始化单链表//*.原创 2020-10-11 17:36:50 · 248 阅读 · 0 评论 -
线性表之顺序表(C/C++)
线性表之顺序表(C/C++)1.表的基本操作引入:#include<stdio.h>#include<stdlib.h>#define InitSize 10#define ElemType int线性表的创建内容:创 销 增 删 改 查表的结构体说明:typedef struct { ElemType *data; int MaxSize; int length;}SeqList;//表的初始化vo...原创 2020-10-11 14:21:26 · 388 阅读 · 0 评论