登录
首页 » Visual C++ » expression

expression

于 2011-10-30 发布 文件大小:419KB
0 161
下载积分: 1 下载次数: 7

代码说明:

  利用栈完成算术表达式求值:从键盘或文件中输入算术表达式,计算其结果并显示。要求处理过程为:(1)转换为后缀表达式并输出;(2)对后缀表达式求值并输出。 输入的表达式中可以有整数、实数、括号,运算符包括+、-、*、/、#(代表单目负)。可以多次输入不同的表达式进行计算,直到用户选择“退出”。栈的基本操作可以自己实现,也可以使用系统提供的STL实现。 (Done using an arithmetic expression evaluation stack: file input from the keyboard or an arithmetic expression, calculate and display the results. Requirements process: (1) to postfix expression and output (2) evaluation of the postfix expression and output. Enter the expression can be integers, real numbers, parentheses, operators including+,-,*,/,#( representatives unary minus). You can enter several different expressions are evaluated until the user selects " Exit." Stack can implement the basic operations, you can also use the system implementation of the STL.)

文件列表:

expression
..........\Epression覆盖率报告
..........\...................\amber.png
..........\...................\bits
..........\...................\....\allocator.h.func-sort-c.html,3821,2011-10-19
..........\...................\....\allocator.h.func.html,3828,2011-10-19
..........\...................\....\allocator.h.gcov.html,23750,2011-10-19
..........\...................\....\basic_ios.h.func-sort-c.html,5283,2011-10-19
..........\...................\....\basic_ios.h.func.html,5290,2011-10-19
..........\...................\....\basic_ios.h.gcov.html,52525,2011-10-19
..........\...................\....\basic_string.h.func-sort-c.html,7104,2011-10-19
..........\...................\....\basic_string.h.func.html,7111,2011-10-19
..........\...................\....\basic_string.h.gcov.html,322852,2011-10-19
..........\...................\....\char_traits.h.func-sort-c.html,3716,2011-10-19
..........\...................\....\char_traits.h.func.html,3723,2011-10-19
..........\...................\....\char_traits.h.gcov.html,60298,2011-10-19
..........\...................\....\index-sort-b.html,7983,2011-10-19
..........\...................\....\index-sort-f.html,7983,2011-10-19
..........\...................\....\index-sort-l.html,7983,2011-10-19
..........\...................\....\index.html,7990,2011-10-19
..........\...................\....\ios_base.h.func-sort-c.html,3851,2011-10-19
..........\...................\....\ios_base.h.func.html,3858,2011-10-19
..........\...................\....\ios_base.h.gcov.html,100087,2011-10-19
..........\...................\....\locale_facets.h.func-sort-c.html,3530,2011-10-19
..........\...................\....\locale_facets.h.func.html,3537,2011-10-19
..........\...................\....\locale_facets.h.gcov.html,277401,2011-10-19
..........\...................\....\stl_algobase.h.func-sort-c.html,3523,2011-10-19
..........\...................\....\stl_algobase.h.func.html,3530,2011-10-19
..........\...................\....\stl_algobase.h.gcov.html,134719,2011-10-19
..........\...................\emerald.png
..........\...................\ext
..........\...................\...\atomicity.h.func-sort-c.html,3914,2011-10-19
..........\...................\...\atomicity.h.func.html,3921,2011-10-19
..........\...................\...\atomicity.h.gcov.html,14817,2011-10-19
..........\...................\...\index-sort-b.html,4964,2011-10-19
..........\...................\...\index-sort-f.html,4964,2011-10-19
..........\...................\...\index-sort-l.html,4964,2011-10-19
..........\...................\...\index.html,4971,2011-10-19
..........\...................\...\new_allocator.h.func-sort-c.html,3915,2011-10-19
..........\...................\...\new_allocator.h.func.html,3922,2011-10-19
..........\...................\...\new_allocator.h.gcov.html,16151,2011-10-19
..........\...................\gcov.css,9893,2011-10-19
..........\...................\glass.png
..........\...................\home
..........\...................\....\swmore
..........\...................\....\......\AList.cpp.func-sort-c.html,5093,2011-10-19
..........\...................\....\......\AList.cpp.func.html,5100,2011-10-19
..........\...................\....\......\AList.cpp.gcov.html,3222,2011-10-19
..........\...................\....\......\AStack.h.func-sort-c.html,5393,2011-10-19
..........\...................\....\......\AStack.h.func.html,5400,2011-10-19
..........\...................\....\......\AStack.h.gcov.html,8230,2011-10-19
..........\...................\....\......\CityInformation.cpp.func-sort-c.html,3966,2011-10-19
..........\...................\....\......\CityInformation.cpp.func.html,3973,2011-10-19
..........\...................\....\......\CityInformation.cpp.gcov.html,3249,2011-10-19
..........\...................\....\......\CityInformation.h.func-sort-c.html,3908,2011-10-19
..........\...................\....\......\CityInformation.h.func.html,3915,2011-10-19
..........\...................\....\......\CityInformation.h.gcov.html,3238,2011-10-19
..........\...................\....\......\Expression.cpp.func-sort-c.html,4881,2011-10-19
..........\...................\....\......\Expression.cpp.func.html,4888,2011-10-19
..........\...................\....\......\Expression.cpp.gcov.html,59371,2011-10-19
..........\...................\....\......\Expression.h.func-sort-c.html,3555,2011-10-19
..........\...................\....\......\Expression.h.func.html,3562,2011-10-19
..........\...................\....\......\Expression.h.gcov.html,9550,2011-10-19
..........\...................\....\......\expressionMain.cpp.func-sort-c.html,3948,2011-10-19
..........\...................\....\......\expressionMain.cpp.func.html,3955,2011-10-19
..........\...................\....\......\expressionMain.cpp.gcov.html,15261,2011-10-19
..........\...................\....\......\index-sort-b.html,10482,2011-10-19
..........\...................\....\......\index-sort-f.html,10482,2011-10-19
..........\...................\....\......\index-sort-l.html,10482,2011-10-19
..........\...................\....\......\index.html,10489,2011-10-19
..........\...................\....\......\LList.cpp.func-sort-c.html,5102,2011-10-19
..........\...................\....\......\LList.cpp.func.html,5109,2011-10-19
..........\...................\....\......\LList.cpp.gcov.html,3223,2011-10-19
..........\...................\....\......\LList.h.func-sort-c.html,3516,2011-10-19
..........\...................\....\......\LList.h.func.html,3523,2011-10-19
..........\...................\....\......\LList.h.gcov.html,3208,2011-10-19
..........\...................\....\......\main.cpp.func-sort-c.html,4206,2011-10-19
..........\...................\....\......\main.cpp.func.html,4213,2011-10-19
..........\...................\....\......\main.cpp.gcov.html,3223,2011-10-19
..........\...................\....\......\project
..........\...................\....\......\.......\AList.h.func-sort-c.html,7723,2011-10-19
..........\...................\....\......\.......\AList.h.func.html,7730,2011-10-19
..........\...................\....\......\.......\AList.h.gcov.html,3253,2011-10-19
..........\...................\....\......\.......\cityDatabase.cpp.func-sort-c.html,4548,2011-10-19
..........\...................\....\......\.......\cityDatabase.cpp.func.html,4555,2011-10-19
..........\...................\....\......\.......\cityDatabase.cpp.gcov.html,3281,2011-10-19
..........\...................\....\......\.......\index-sort-b.html,5781,2011-10-19
..........\...................\....\......\.......\index-sort-f.html,5781,2011-10-19
..........\...................\....\......\.......\index-sort-l.html,5781,2011-10-19
..........\...................\....\......\.......\index.html,5788,2011-10-19
..........\...................\....\......\.......\List.h.func-sort-c.html,3562,2011-10-19
..........\...................\....\......\.......\List.h.func.html,3569,2011-10-19
..........\...................\....\......\.......\List.h.gcov.html,3239,2011-10-19
..........\...................\....\......\Stack.h.func-sort-c.html,3682,2011-10-19
..........\...................\....\......\Stack.h.func.html,3689,2011-10-19
..........\...................\....\......\Stack.h.gcov.html,5175,2011-10-19
..........\...................\i686-linux-gnu
..........\...................\..............\bits
..........\...................\..............\....\gthr-default.h.func-sort-c.html,3576,2011-10-19
..........\...................\..............\....\gthr-default.h.func.html,3583,2011-10-19

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论


0 个回复

  • Ex3
    c++实现的静态链表 可以从屏幕输入来构建静态链表 数据结构重要的部分(c++ implemented statically linked list can be input from the screen to the important part to build a static linked list data structure)
    2012-11-27 15:19:25下载
    积分:1
  • Campus-navigation-problem
    校园导航问题,设计你的学校的平面图,至少包括10个以上的景点(场所),每两个景点间可以有不同的路,且路长也可能不同,找出从任意景点到达另一景点的最佳路径(最短路径)。 要求: (1)以图中顶点表示校园内各景点,存放景点名称、代号、简介等信息;以边表示路径,存放路径长度等有关信息。 (2)为来访客人提供图中任意景点相关信息的查询。 (3)为来访客人提供任意景点的问路查询,即查询任意两个景点之间的一条最短路径。 (4)修改景点信息。 (Campus navigation problem, the design of your school s plan, at least more than 10 attractions (places), between every two spots can have a different way, and the long road may be different, to find spots to reach from any other attractions best path (shortest path). Requirements: (1) graph vertices represent various campus sites, storage sites name, code, profile and other information the side that path, the path length of storage of information. (2) the figure for visiting any sites offering information about the query. (3) any attractions for visiting guests ask queries of that query any two of the shortest path between sites. (4) modify the attractions information.)
    2011-08-12 10:34:14下载
    积分:1
  • ahuangCD
    这个是数据结构课程设计中阿黄的CD的程序代码的工程文件包(This is a data structure curriculum design A yellow CD program code works package)
    2013-12-21 18:53:00下载
    积分:1
  • npxkcsj
    数据结构课程设计,多种内部排序的效率分析(Data structure course design, the efficiency of a variety of internal sorting)
    2010-07-07 07:34:56下载
    积分:1
  • we
    说明:   简单的链表实现 链表可以初步了解(A simple list can be linked to achieve a preliminary understanding)
    2008-12-10 17:08:15下载
    积分:1
  • tree
    求二叉树的深度: 给定一个有根二叉树,规定连接两个节点的每条边长度是1,定义树的深度为根到叶子节点距离的最大值。 (Description 给定一个有根二叉树,规定连接两个节点的每条边长度是1,定义树的深度为根到叶子节点距离的最大值。 )
    2011-12-11 20:42:18下载
    积分:1
  • Data-Structure11-15
    本书是关于计算机科学与工程领域的基础性研究科目之一——数据结构与算法的专著。 本书在简要回顾了基本的C++ 程序设计概念的基础上,全面系统地介绍了队列、堆栈、树、图等基本数据结构,以及贪婪算法、分而治之算法、分枝定界算法等多种算法设计方法,为数据结构与算法的继续学习和研究奠定了一个坚实的基础。更为可贵的是,本书不仅仅介绍了理论知识,还提供了50多个应用实例及600多道练习题。 本书内容广博权威,结构清晰合理,是一本全新的有关数据结构与算法的教材,对于计算机科学与工程领域的从业人员也是一本很好的参考书。 11-15章 (This book is about the field of computer science and engineering subjects of basic research- data structures and algorithms monographs. In a brief review of the book based on the basic concept of C++ programming on a comprehensive and systematic introduction to the queues, stacks, trees, graphs and other basic data structures, and the greedy algorithm, a variety of algorithms divide and conquer algorithms, branch and bound algorithm design method for data structures and algorithms continue to learn and study laid a solid foundation. More valuable is the book not only theoretical knowledge, but also provides more than 50 application examples and more than 600 channel exercises. Book a broad authority, clear and reasonable structure, is a new data structures and algorithms related materials, for the field of computer science and engineering practitioners also a good reference book. Chapter 11-15)
    2014-05-30 09:27:46下载
    积分:1
  • maze
    一个苹果走迷宫,支持最短路径寻路。可以使用方向键操作,也可以用户自己添加迷宫格式文件,生成迷宫图。(Apple Maze, shortest path routing. Can use the arrow keys to operate, the user can add their own maze format generated maze.)
    2012-09-11 21:33:01下载
    积分:1
  • yinhangjiasuanfa
    一个很好的银行家算法,能运行(A good banker s algorithm, will be able to run)
    2008-06-14 13:44:24下载
    积分:1
  • bintree
    一个关于二叉树应用的小程序,包括二叉树的建立,前中后遍历等操作(a program about bintree structure)
    2009-05-17 16:54:29下载
    积分:1
  • 696518资源总数
  • 105383会员总数
  • 1今日下载