大数阶乘 单链表.pdf

/ 大数阶乘_单链表.cpp : Defines the entry point for the console application. / / file chain.h #ifndef Chain_ #define Chain_ #include #include #include cnode.h #include xcept.h template class ChainIterator; template class Chain friend ChainIterator; public: Chain() first = 0;/构造函数 Chain();/析构函数 bool IsEmpty() const return first = 0;/判断链表是否为空 int Length() const;/求链表的长度 bool Find(int k, T/查找第 k 个元素 int Search(const T/查找元素 x Chain/删除第 k 个元素 Chain/在第 k 个元素之后插入 x void Output(ostream/单链表的输出 Chain/求大数阶乘 private: ChainNode *first;/ 指向第一个节点 ; template Chain:Chain() /删除所有的节点 ChainNode *next; while (first) next = first-link; delete first; first = next; template int Chain:Length() const / 返回链表的长度 ChainNode *current = first; int len = 0; while (current) len+; current = current-link; return len; template bool Chain:Find(int k, T ChainNode *current = first; int index = 1; while (index link; index+; if (current) x = current-data; return true; return false; template int Chain:Search(const T int index = 1; while (current index+; if (current) return index; return 0; template Chain ChainNode *p = first; if (k = 1) first = first-link; else ChainNode *q = first; for (int index = 1; index link; if (!q | !q-link) throw OutOfBounds(); p = q-link; q-link = p-link; x = p-data; delete p; return *this; template Chain ChainNode *p = first; for (int index = 1; index link; if (k 0 ChainNode *y = new ChainNode; y-data = x; if (k) y-link = p-link; p-link = y; else y-link = first; first = y; return *this; template void Chain:Output(ostream int i=0,j=Length(); for (current = first; current;current = current-link) i+; if(i=j else outdata ; i=1; j-; current=first; outsetw(3)setfill(0)data ; template /重载运算符999) Insert(i,j%1000); i+; j=j/1000; Insert(i,j); /计算 long m=0, k=0/进位 ; ChainNode *current; for(;n2;n-) for (current = first;current;current = current-link) m=k; k=(current-data*(n-1)+k)/1000; current-data=(current-data*(n-1)+m)%1000; if(!current-link k=k/1000; Insert(Length(),k); k=0; break; return *this; #endif / file cnode.h / exception classes for various error types #ifndef Xcept_ #define Xcept_ #include / bad initializers class BadInitializers public: BadInitializers() ; / insufficient memory class NoMem public: NoMem() ; / change new to throw NoMem instead of standard behavior / Visual C+ requires following form of my_new_handler int my_new_handler(size_t x) throw NoMem(); / even though the following statement is unreachable, / visual C+ will not compile successfully without it return 0; ; _PNH Old_Handler_ = _set_new_handler(my_new_handler); / improper array, find, insert, or delete index / or deletion from empty structure class OutOfBounds public: OutOfBounds() ; / use when operands should have matching size class SizeMismatch public: SizeMismatch() ; / use when zero was expected class MustBeZero public: MustBeZero() ; / use when zero was expected class BadInput public: BadInput() ; #endif #ifndef ChainNode_ #define ChainNode_ template class Chain; template class ChainIterator; template class KeyedChain; template class LinkedStack; template class ChainNode friend Chain; friend ChainIterator; friend KeyedCha