数据结构之大数阶乘.docVIP

实习一之大数阶乘 // dashujiecheng.cpp : Defines the entry point for the console application. // #include stdafx.h #includeiostream #include stdio.h using namespace std; //链表的类定义 class ChainNode { friend class Chain; private: int data; ChainNode* link; }; class Chain { public: Chain(){first = 0;} ~Chain(); bool IsEmpty() const {return first == 0;} int Length() const; bool Find(int k, int x)const; int Search(const int x) const; Chain Delete(int k, int x); Chain Insert(int k, const int x); Chain Change(int k, int x); void OutputOne(const ChainNode* current); void Output(); int OutOfBounds(); private: ChainNode* first; }; //删除链表中的所有节点 Chain::~Chain() { ChainNode * next; while(first) { next = first-link; delete first; first = next; } } //确定链表的长度 int Chain::Length() const { ChainNode* current = first; int len = 0; while(current) { len++; current = current-link; } return len; } //在链表中查找第K个元素 bool Chain::Find(int k,int x)const { if(k1) return false; ChainNode* current = first; int index = 0; while(index k current ) { current = current-link; index++; } if(current) { x = current-data; return true; } return false; } //在链表中搜索 int Chain::Search(const int x) const { ChainNode* current = first; int index = 1; while(current current-data != x) { current = current-link; index++; } if(current) return index; return 0; } int Chain::OutOfBounds() { couterrorendl; return 0; } //////////////////////////////////////////////////////////////////////////////////// /*改为递归，才能先输出高位后输出低位*/ void Chain::OutputOne(const ChainNode* current)//另外加的函数............... { if (current) { OutputOne(current-link); if (current-link) printf(%03d, current-data); /*必须输出3位*/ else printf(%d, current-data); /*输出最高位时不能用%03d*/ } } voi