《数据结构算法》知识整.docVIP

《数据结构与算法》知识整理 章节 原理 实现 备注 2 定义： A stack is a data structure in which all insertions and deletions of entries are made at one end, called the top of the stack. The last entry which is inserted is the first one that will be removed. 实现： const int maxstack = 10; class Stack { public: Stack( ); bool empty( ) const; Error_code pop( ); Error_code top(Stack_entry item) const; Error_code push(const Stack_entry item); private: int count; Stack_entry entry[maxstack]; }; Error_code Stack :: push(const Stack_entry item) { Error_code outcome = success; if (count = maxstack) outcome = overflow; else entry[count++] = item; return outcome; } Error_code Stack :: pop( ) { Error_code outcome = success; if (count == 0) outcome = underflow; else --count; return outcome; } Error_code Stack :: top(Stack_entry item) const { Error_code outcome = success; if (count == 0) outcome = underflow; else item = entry[count - 1]; return outcome; } bool Stack :: empty( ) const { bool outcome = true; if (count 0) outcome = false; return outcome; } Stack :: Stack( ) { count = 0; } 应用： 计算器 括号匹配 3 队列定义： 队列是一种先进先出的线性表。它只允许在表的一端进，另一端出元素 实现： class Queue { public: Queue(); //构造该函数 bool Q_empty(); //判断队列是否为空 state serve(); //元素出队列 state append( queue_entry item);//元素入队列 queue_entry retrieve();//返回首元素 queue_entry Q_sizeentry() //查询元素 { int A=sizecount(); for(int i=0;iA;i++){ coutQ_entry[i] ; } return 0; } int sizecount() { return count; } void clear(); //清空队列 protected: int count; int front,rear; queue_entry Q_entry[maxqueue]; }; //queue类的方法的实现 //构造函数的实现 Queue::Queue() //构造一个队列 { count=0; //rear=0; rear=maxqueue-1; front=0; } //empty的实现 bool Queue::Q_empty() { bool outcome=true; if(count=0) return outcome; else { outcome=false; return outcome; } } //实现元素入队列 state Queue::append( queue_entry item) { if(count=maxqueue)return overflow; else { rear=(rear+1