摘要：
//队列非递归遍历需要template<class NodeType>class Stack{public: Stack(){nIndex = 0;} ~Stack(){} //入栈 void Push(NodeType *p) { arr[nIndex] = p; ++nIndex; } //获取栈顶元素 NodeType *Top() { --nIndex; if (nIndex<0) { nIndex = 0; return NULL; } return arr[nIndex]; } bool IsEmpty() { return nIndex == 0; }priva 阅读全文
摘要：
int _tmain(int argc, _TCHAR* argv[]){ char num1[100] = {'1'}; char num2[100] = {'2'}; char sum[101] = {0}; for (int i=0;i<100;++i) { num1[i] = '1'; num2[i] = '9'; } int nJinWei = 0; int nTmpSum = 0; for (int i=0;i<100;++i) { nTmpSum = (num1[i] - '0') + ( 阅读全文