登录
首页 » Visual C++ » expression

expression

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

  • 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
  • DLinkedList
    双链表的定义和插入算法，双链表的定义，删除，插入和查找算法(Doubly linked list of definitions and insertion algorithm, the definition of double-linked list, delete, insert, and search algorithm)
    2013-07-17 15:38:38下载
    积分：1
  • HuffanCoding
    读取数据，统计所得到的文件中每个字母的权值，创建哈夫曼树，哈夫曼编码。哈夫曼解码，解码后内容写入到指定的文件。 读取数据里面的内容是由英文单词组成。读取文件的时候传入文件存放的路径、读取方式以及读出以后存放的数组，最终可以得到一个存放目标文件内容的数组。 将得到的数组进行字母权值的统计，统计每个字母出现的次数，次数即为每个字母的权值。 将得到的字符数组与权值数组作为创建哈夫曼树的依据，哈夫曼树根据每个字母权值的大小来创建，每个节点，包括权值、父节点、左子、右子和字母本身。 根据哈夫曼树进行编码。形成目标文件的哈夫曼编码，将此编码返回。 根据哈夫曼树得到的数组即为解码数组，解码数组作为解码的结果返回。 写入输出文件，将解码得到的数组、文件的完整路径以及文件的写方式作为参数传入，将数组写入到相应的文件中。 (Read the data, statistical documents obtained weights for each letter, create a Huffman tree, Huffman coding. Huffman decoding, the decoded contents are written to the specified file. Read the content inside is composed of English words. When the incoming file to read the file storage path, read mode and read out after storage array that can eventually get a storage target file contents of the array. The resulting array of letter weights statistics, statistical number of occurrences of each letter, the number is the weight of each letter. The resulting character array with the weights array as the basis for creating Huffman tree, Huffman tree based on the size of the weights of each letter to create, for each node, including weights, parent, left child, right child, and letter itself. According to Huffman coding. The formation of the target file Huffman coding, this code returns. According to Huffman decoding the resulting array is an array, the decoder decodes the result is retur)
    2020-07-02 15:40:01下载
    积分：1
  • KMP
    数据结构中KMP算法c语言实现，vc6.0环境(KMP algorithm in c language data structure, vc6.0 environment)
    2013-03-27 14:04:39下载
    积分：1
  • 1
    说明：  贪婪算法的简单描述 不过没做完 只是想下个程序 用用。。。。 (greed math)
    2012-04-26 19:56:56下载
    积分：1
  • Kruskal
    采用Kruskal算法求最小生成树主要数据结构 edgeset GE 存放图中的所有边 int n,int e 存放图中的顶点数与边数 edgeset C 存放生成树中的边 vexlist gv 图中结点的顶点值 adjmatrix s 用来处理图中结点的查找与合并 int m1,m2 一条边上两顶点所属集合的序号 int k 最小生成树中的边数 int d //图中待扫描边元素的下标(For the Minimum Spanning Tree by Kruskal main data structures edgeset GE store all edges in the figure int n, int e store graph vertices and edges edgeset C storage spanning tree edges in the vexlist gv graph node vertex values ​ ​ adjmatrix s used to process graph node to find and merge int m1, m2 an edge belongs to the set number two vertices int k minimum spanning tree edges int d // figure to be Scan edge element subscript)
    2011-05-17 10:22:56下载
    积分：1
  • huisuo
    实现回溯算法，能解决八皇后问题等～～算法结果优化，时间复杂度较小(Implement backtracking algorithms can solve the eight queens problem, etc. ~ ~)
    2011-12-14 11:59:39下载
    积分：1
  • Nqueen
    n皇后问题构造法实现，比起启发式修补运行时间较长。(n Queen realize the issue of construction method, compared to a longer run-time heuristic repair.)
    2008-05-16 12:45:32下载
    积分：1
  • BFS
    迷宫问题 队列求解 界面还不完善 可以自己添加(Maze problem solving interface queue is not perfect you can add your own)
    2013-12-26 22:08:58下载
    积分：1
  • lab07
    本例主要设计查找的有关算法，例如有序表的查找和顺序标的查找，顺序查找、折半查找及二叉排序树上查找的基本思想和算法实现等。(In this case mainly designed to find the relevant algorithm, such as an ordered list of the find and order the subject to find, sequential search, binary search and binary sort tree to find the basic idea and algorithm.)
    2013-05-12 22:01:58下载
    积分：1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载

热门标签

Visual C++ matlab C/C++ Java Others Unix_Linux EasyLanguage易语言 Visual Basic C# PDF C++ Delphi VHDL ASP WINDOWS
热门下载

Copyright© 2019-2026 | Powered by Imdn | 浙ICP备16007336号 | IMDN交流 | 联系客服（QQ：3324461878）

本网站资源收集自网络及网站用户上传，若有侵权请邮件至（3324461878@qq.com），核实后我们会在24小时内删除，谢谢！