unity_3d_的博客

  看别人写的，自己又写一遍。仅供自己学习。//单链表的操作 #include<iostream> using namespace std; typedef int DataType; #define Node ElemType #define ERROR NULL  //构建一个节点类 class Node{  public:  int data;//数据域   Node *ne...

#include<iostream>#include<stdlib.h> using namespace std;typedef struct node{ int data; struct node *prior; struct node *next;}DNode;//创建一个带有头结点的双链表void CreateDLink(DNode *&head) { int...

#include<iostream>using namespace std;int maxSize = 100;template<class T>class SqListClass{ private: T* data; int length; public: SqListClass();//构造函数  ~SqListClass();//析构函数  void CreateL...

#include<iostream>using namespace std;template <class T>class Stack{ private: int mSize; int top; T *str; public: Stack(int mSize) { top = -1; str = new T[mSize]; } ~Stack() { ...

进栈操作实际上就是在单链表插入头结点，出栈操作实际上是单链表删除头结点。#include<iostream>using namespace std;template <class T>struct node{ T value; node<T> * next; node():next(NULL) { }//构造函数   node(T e):next(NULL)...