![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
数据结构
AIGNl
这个作者很懒,什么都没留下…
展开
-
Lisp2 expression
/* lval.c-lval constructor---lval_num---lval_err---lval_sym---lval_sexpr-lval reader---lval_read_num---lval_read-lval appender and destrucctor---lval_add---lval_del-lval printer---lval_expr_print---lval_print---lval_println-lval processor.原创 2020-08-25 22:17:29 · 170 阅读 · 0 评论 -
Lisp1 eval
-Lisp通过正则表达式和mpc文件构建语法树构建终端缓冲区,提供命令行输入对各文件进行拆分通过自定义运算数据结构体lval对用户命令进行解析,得出运算结果,返回并打印结果#include "mpc.h"#ifdef _WIN32static char buffer[2048];char* readline(char* prompt) { fputs(prompt, stdout); fgets(buffer, 2048, stdin); char* cpy = mal原创 2020-08-24 22:24:11 · 294 阅读 · 0 评论 -
数据结构复习13 静态链表
const in maxSize=100;template<class T>struct StaticLinkNode{ T data; int link;};class StaticLinkList{ protected: StaticLinkNode<T> elem*; int avil;//address for init memory public: void InitList(); int Length(); int Search(const T原创 2020-08-24 13:30:29 · 187 阅读 · 0 评论 -
数据结构复习12 树与二叉树
template<class T>struct BinTreeNode{ T elem; BinTreeNode<T> *left; BinTreeNode<T> *right; BinTreeNode():left(NULL),right(NULL){} BinTreeNode(T x,BinTreeNode<T> *l=NULL,BinTreeNode<T> *r=NULL):elem(x),left(l),right(r) {}原创 2020-08-23 17:56:07 · 178 阅读 · 0 评论 -
KMP算法关键点解释
设主串为T,匹配串为P KMP算法的优点是通过证明了已匹配模式串子串的最大前后缀来保证模式串指针j可以不用回到原创 2020-08-23 10:34:22 · 248 阅读 · 0 评论 -
数据结构复习10 串
string.h/* string DIY process must be the most important in our job *//* string is a sequent list limited *//* string.h--int strcpy(s1,s2) copy s2 content to s1 **if s1 bigger than s2,the front content will be reaplaced,with remain the last content--i原创 2020-08-21 19:42:12 · 122 阅读 · 0 评论 -
数据结构复习9 数组
稀疏矩阵1/* Trituple.cpp*/#include<iostream.h>#include<stdlib.h>using namespace std;const int DefaultSize=100;template<class T>struct Trituple{ int row,col; T value; Trituple<T>& operator=(Trituple<T> &t){ row=原创 2020-08-21 18:30:48 · 97 阅读 · 0 评论 -
数据结构复习8 优先级队列(最小优先级)
#include<assert.h>#include<iostream.h>#include<stdlib.h>using namespace std;const int DefaultSize=50;template<class T>class PQueue{ protected: T *PQelem; int count; int maxSize; void adjust(); public: PQueue(int size=De原创 2020-08-20 22:00:34 · 120 阅读 · 0 评论 -
数据结构复习7 递归
汉诺塔void Hanoi(int n,string A,string B,string C){ //move disk from A to C by B //stop if(n==1){ //simpliy move cout<<"move one disk from"<<A<<"to"<<C<<endl; } //move by move(n-1) Hanoi(n-1,A,C,B); cout<<"move原创 2020-08-20 17:53:44 · 103 阅读 · 0 评论 -
数据结构复习6 栈应用
括号匹配void MatchingBrackets(string &str){ stack<string> bra; int len=str.size();//unsigned int string<T>::size() int i=0; while(i<len){ char temp=str.at(i);//char string<T>::at(int i) if(temp=='{' || temp== '(' || temp== '['原创 2020-08-20 14:06:41 · 83 阅读 · 0 评论 -
数据结构复习5 队列
/* Queue.h */#ifndef QUEUE_H#define QUEUE_Hconst int maxSize=50;template <class T>class Queue{ public: Queue(){}; ~Queue(){}; virtual void EnQueue(const T &x)-0; virtual bool DeQueue(T &x)=0; virtual bool getFront(T &x)=0; vir原创 2020-08-20 11:41:10 · 121 阅读 · 0 评论 -
数据结构复习4 双向链表
/* DbList.cpp*/template<class T>struct DbNode{ T data; DbNode<T> *lLink,*rLink; DbNode(DbNode<T> *l=NULL,DbNode<T> *r=NULL):lLink(l),rLink(r){} DbNode(T value,DbNode<T> *l=NULL,DbNode<T> *r=NULL):data(value),lLink(原创 2020-08-19 09:49:12 · 119 阅读 · 0 评论 -
数据结构复习3 栈
栈链式存储.cpp和顺序存储.cpp/* Stack.h */#ifndef STACK_H#define STACK_Hconst int maxSize=50;enum bool{false,true};template<class T>class Stack{ public: Stack(){}; virtual void Push(const T &x)=0; virtual bool Pop(T &x)=0; virtual bool getT原创 2020-08-19 00:50:55 · 83 阅读 · 0 评论 -
数据结构复习2 顺序表和链表应用
顺序表合并.cpp/* OrderList Union.cpp */void MergeList_Order(OrderList<T> &la,OrderList<T> &lb,OrderList<T> &l){ int pa=0,pb=0,pc=0; l.capcacity=la.capacity+lb.capacity; l.last=la.last+lb.last; l.elem=new T[l.capacity]; //ele原创 2020-08-18 22:11:54 · 144 阅读 · 0 评论 -
数据结构复习1 线性表
顺序结构#define OK 1#define ERROR 0#define OVERFLOW -2#include<stdlib.h>#include<stdio.h>#define MAXsize 100typedef int ElemTypetypedef int Statustypedef struct SqList{ int length; ElemType * elem;}OrderList;//initvoid InitList(Order原创 2020-08-17 21:25:55 · 187 阅读 · 0 评论