normol的博客

#include using namespace std; template class shuju{ public: T data; shuju *next; }; template class que{ public: void insert(T); void print(); void goout(int n); private: shuju *first; int len;

#include using namespace std; int reverse(int num){ int temp=0; while (num){ temp += num % 10; if (num/10) temp = temp * 10; num = num/10; } return temp; } int main(){ int count,k; long

#include using namespace std; int main(){ int person[5005]={0}; int n; cin >> n; while (n--){ int num,numtemp,i; cin >> num; numtemp = num; for ( i = 0; i < num; i++){ person[i] = i

struct TreeNode{ int data; TreeNode* lchild, *rchild; }; TreeNode * search(TreeNode * &root, int key){ TreeNode *p,*s; s=p = root; while (p){ s = p; cout data << endl; if (p->data == key)

今天晚上知道了这个算法，看了后凭记忆理解自己又写了一遍，日后会加上注释和思路

typedef struct BiTNode{ char data; BiTNode* lchild, *rchild; int lflag, rflag; }BiTree; //中序线索化 void InThreading(BiTree* t){ if (t != NULL) { InThreading(t->lchild);//找到属于叶节点的左孩子 if (t->

非递归实现 typedef struct BiTNode{ char data; BiTNode* lchild, *rchild; }BiTree; //非递归实现二叉树的建立 BiTree* BiTreeCreate(){ BiTree* Q[100]; char ch; int front, rear; BiTree* s, *root; root = NULL; fro

#include #include #include using namespace std; int main(){ int n; while (cin >> n) { bool flag = false; char* pin = new char[5*n]; char* pout = new char[5*n]; int* data = new int[5*n];

//student.h #ifndef student_h #define student_h #include #include using namespace std; class student{ private: string name; string sex; public: friend ostream& operator<<(ostream& cout,student &s

//head.h typedef struct GLNode{ char name[100]; char prof[100]; int type; struct { /*理解：hp是同级关系，tp是上下级关系*/ struct GLNode* hp, *tp; }ptr; }GList; //test.cpp #include"head.h" #include #inc