- 博客(7)
- 问答 (1)
- 收藏
- 关注
RSS订阅原创 【数据结构】堆与堆排序
//heap.h#pragma once#includeusing namespace std;class Heap {//静态实现堆private: int count; //堆中元素个数 int capacity; //堆的大小 int *array; //数组实现堆 int heap_type; //最小堆或最大堆，0为最小，1为最大public: Heap(int
2016-12-15 15:38:10
229
原创 【数据结构】二叉搜索树
//BST.h#pragma once#include#include#includeusing namespace std;typedef char ElemType;typedef struct node { ElemType data; struct node* lchild; struct node* rchild;}*BST,BSTree;int Creat(B
2016-11-20 20:36:48
203
原创 【数据结构】顺序表与链式实现队列并测试
顺序表：#pragma oncetypedef char ElemType;#define QueueSize 100typedef struct Queue { ElemType queue[QueueSize]; int front, rear;}SeqQueue;void InitQueue(SeqQueue *Q){ Q->front = Q->rear = 0;
2016-11-13 18:19:01
359
原创 【数据结构】走迷宫实现
#pragma once#ifndef _MAZE_H_#define _MAZE_H_struct Intersection { int left, forwd, right; //路口信息};struct Maze { int MazeSize; //迷宫大小（路口数） int EXIT; //出口号码 Interse
2016-11-10 19:33:11
2669
原创 【数据结构】中缀表达式的实现
#include#include#include#includeusing namespace std;vector Pre(const string a)//pre process with string.{vector strs;int l = a.length();int i = 0;for (i = 0; i {char te
2016-11-08 22:12:58
426
原创 【数据结构】后缀表达式算法实现
#include#include#includeusing namespace std;void main(){stack S;string m;cout cin >> m;int l = m.length();for (int i = 0; i {switch (m[i]){case '+':{double a = S.to
2016-11-07 14:27:19
659
原创 【数据结构】链表实现括号匹配
#pragma once//LinkStack.h#includeusing namespace std;typedef char DataType;typedef struct node{DataType data;struct node *next;}LStackNode, *LinkStack;void InitStack(LinkStac
2016-11-07 10:56:19
997
空空如也
【C++二叉搜索树】采用STL实现广度遍历时遇见的问题
2016-11-20
TA创建的收藏夹 TA关注的收藏夹
TA关注的人