(中秋节快乐)离散大家上机第2题(国外英文资料).doc

(中秋节快乐)离散大家上机第2题(国外英文资料).doc

  1. 1、本文档共44页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
(中秋节快乐)离散大家上机第2题(国外英文资料)

(中秋节快乐)离散大家上机第2题(国外英文资料) The header file Name of the class. H / / define the storage operator stack The class SeqStack { Public: SeqStack (int size); Virtual ~ SeqStack (); Bool Pop (); / / remove the top element of the stack Void Push (const char item); / / push in the stack Char Top (); / / return stack top elements Bool Clear (); / / remove the stack Boolean IsEmpty () const; / / determines if the stack is empty Int Size () const; / / the number of elements in the stack Private: Int maxSize; / / the maximum capacity of the stack Int top; / / stack top position Char * op; / / an array of operators }; / / the bool value stack that corresponds to the propositional element in storage The class IntStack { Public: IntStack (int size); Virtual ~ IntStack (); (const int factor); / / push in the stack Int Top (); / / return stack top elements Bool changTop (int item); / / change the top value of the stack Bool Pop (); / / remove the top element of the stack Bool Clear (); / / remove the stack Boolean IsEmpty () const; / / determines if the stack is empty Int Size () const; / / the number of elements in the stack Private: Int maxSize; / / the maximum capacity of the stack Int top; / / stack top position Int * intFactor; / / an array of operational factors }; / / The class Arry { Public: Arry (); ~ Arry (); Int, icp (char c) const; / / the priority order of the stack Int isp (char c); / / the priority order in the stack Bool whetherOP (char c) const; / / is it an operator Char compare (char c) const; / / take an operator and compare the top of the stack Bool getPostfix (); / / processing operator function, which gives the postfix expression Bool getPropotion (); / / find the single proposition element in the postfix expression Void BINadd (); / / binary Numbers are added once Const intnum 1, const intnum 2, const char op; / / calculate Bool getBool (); / / the bool value of the formula Bool prin (); / / output postfix expressions Void continueORend (); / / functio

文档评论(0)

f8r9t5c + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

版权声明书
用户编号:8000054077000003

1亿VIP精品文档

相关文档