登录
首页 » Visual C++ » expression

expression

于 2011-10-30 发布 文件大小:419KB
0 259
下载积分: 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 个回复

  • The-sum-of-Multinomial
    数据结构中的一元多项式相加,多于考研算法实现很重要。后续部分将在后期上传!(The sum of Multinomial)
    2011-05-09 15:47:30下载
    积分:1
  • Dijkstra
    主要是DIJKSTRA经典算法,可以作为单个算法来读,也可以调用。(DIJKSTRA mainly classical algorithm can be read as a single algorithm can also be called.)
    2010-09-25 17:37:40下载
    积分:1
  • HEAP
    poj 实现堆结构的源代码。。。话说其实没什么实际功能好么(poj achieve heap structure of the source code. . . In fact, the actual function of saying okay nothing)
    2013-11-21 23:03:15下载
    积分:1
  • Lecture7
    数据结构中插入排序,堆栈排序等的用法还有希尔排序(Data structure insertion sort, stack, sort, etc. use well sorted Hill)
    2011-07-27 15:31:31下载
    积分:1
  • C-integer-linear-sequence
    对元素类型为整型的顺序存储的线性表进行插入、删除和查找操作(C++)。(C integer linear sequence of stored data table insert, delete and search operations)
    2011-11-20 11:13:40下载
    积分:1
  • route-planning
    遗传算法实现飞机在三维空间的航迹规划 C代码(Genetic Algorithm Route Planning C code)
    2012-04-20 09:23:18下载
    积分:1
  • bookmanage
    基于数据结构的图书管理系统,基本功能都有,可以拿来作为数据结构的课程设计(Based library management system data structures, basic function, can be used as a data structure of the curriculum design)
    2020-10-27 00:00:04下载
    积分:1
  • bag1
    使用不同的方法解决背包问题:本算法采用的是动态规划方法,比较好的解决背包问题。(Use different methods to solve knapsack problem: The algorithm is a dynamic programming approach, a better solution to knapsack problem.)
    2011-07-16 18:40:31下载
    积分:1
  • astar
    A*算法 1、将开始节点放入开放列表(开始节点的F和G值都视为0) 2、重复以下步骤: 在开放列表中查找具有最小F值的节点,并把查找到的节点作为当前节点 把当前节点从开放列表删除, 加入到封闭列表. (A* algorithm 1, will begin to node placed in the and opening up list of (the began to node of the F and G values ​ ​ are regarded as 0) 2, repeat the the following steps: to Find a the has a the the smallest F value of the node in the the and opening up list of, and put Find a to the node as the current node current node is removed from the open list, added to the closed list.)
    2013-04-04 11:06:42下载
    积分:1
  • structure-array-code
    根据队列搜索算法的基本思想,现设计了一个简单的结构体数组如下定义代码所示。此结构体数组具备控制结点搜索和存储结点信息和路径的功能,可以较好的实现TDN的最小时间路径搜索。(Search algorithm based on the basic idea of ​ ​ the queue is now designed a simple structure array as defined code. This structure array with the control node and storage node information search and path functions, you can achieve better TDN minimum time path search.)
    2013-10-09 14:35:43下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载