登录
首页 » Visual C++ » 11组表达式求值

11组表达式求值

于 2017-06-14 发布 文件大小:418KB
0 91
下载积分: 1 下载次数: 1

代码说明:

  设计一个表达式求值的程序。该程序必须可以接受包含(,),+,-,*,/的中缀表达式,并求出结果。如果表达式正确,则输出表达式的结果;如果表达式非法,则不输出或输出其他字符。(Design an expression evaluation procedures. The program must accept (,), including +, -, *, / the infix expression, and the results obtained. If the expression is correct, the output of the expression is output; if the expression is illegal, no other characters are output or exported.)

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

发表评论

0 个回复

  • PrintTheSchedule_DataStructure_Lab4
    数据结构试验-打印输出计算机本科专业4年每学期的课表;C++实现;图的邻接表存储结构以及拓扑排序的基本思想(Data structure test- printout computer 4 years of undergraduate per semester timetables C++ achieve basic idea of ​ ​ the adjacency table storage structure and topological sorting)
    2012-11-24 23:30:41下载
    积分:1
  • QuickSort
    快速排序,用数组的存储结构,实现数的排序。共有八组随机数据,还能够计算出每组数据的处理时间,最终得到平均时间。(Quicksort array storage structure, to achieve the sort of number. A total of eight sets of random data, but also be able to calculate the processing time of each data, and eventually obtain the average time.)
    2013-03-22 21:21:16下载
    积分:1
  • data-struct
    对于数据结构每一章节的相应的练习题,巩固好数据结构(To consolidate data structure corresponding practice questions for each chapter of the data structure)
    2012-10-09 17:03:41下载
    积分:1
  • Test6
    最短路径算法。 用无向带全图的邻接矩阵存储图,确定从源点出发到其它各点的最短路径。 输入:图中包含的顶点数n 边数m, 各边权值,用邻接矩阵或者邻接表存储。 输出:源点到其它各点的最短路径值。(Shortest path algorithm. Adjacency matrix storage with undirected graph with a full figure, determine the starting point of the shortest path from the source point of each other. Input: Vertices figure included n the number of edges m, the weight of each side, with the adjacency matrix or adjacency table storage. Output: source shortest path to value each other points.)
    2014-05-11 17:05:37下载
    积分:1
  • a
    说明:  进程死锁.资源分配图的绘制 建立所需数据结构;  使用题目21存成的资源分配图的文件作为输入;  编写资源分配图化简算法;  每化简一步,在屏幕上显示化简的当前结果;  最后给出结论,是否死锁,如思索给出死锁的进程及资源; (Process deadlock. Resource allocation mapping  establish the required data structures  Use title 21 deposit into resource allocation graph file as input  writing resource allocation map simplification algorithm  Each simplification step, on-screen display simplification of the current result  Finally, the conclusion of a deadlock, deadlock is given as thinking processes and resources )
    2013-07-04 19:50:58下载
    积分:1
  • tree
    二叉树的先序遍历。采用递归实现。释放资源时用了后序遍历。(Preorder traversal of a binary tree. Recursive implementation. Release resources used after preorder.)
    2013-07-09 13:39:31下载
    积分:1
  • 第4章
    清华大学出版社,数据结构简明教程李春葆著,第四章源文件(Tsinghua University press, a brief course on data structure, Li Chunbao, fourth chapters)
    2018-02-03 14:39:12下载
    积分:1
  • data_structure
    数据结构c源代码实现,大概有100个左右,基本上将所有的数据结构都有介绍(Data structures c source code to achieve, there are about 100 or so, basically all of the data structures are described)
    2012-07-19 21:43:52下载
    积分:1
  • C1
    说明:  由C程序实现的 数学上 滑雪问题 的代码实现,供大家学习用(Ski problem code for all to learn to use)
    2011-05-28 14:51:40下载
    积分:1
  • a
    说明:  100米比赛排名 C++实现100米比赛排名 C++实现(100m rankings C++, the 100 meters ranks C++,)
    2010-11-19 23:24:18下载
    积分:1
  • 696518资源总数
  • 104349会员总数
  • 32今日下载