登录
首页 » Visual C++ » Ex1

Ex1

于 2012-11-27 发布 文件大小:1KB
0 173
下载积分: 1 下载次数: 2

代码说明:

  从屏幕输入字符 判断括号匹配问题 数据结构作业(Judgment parenthesis matching data structure operations input characters from the screen)

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

发表评论

0 个回复

  • toycon
    二查树遍历文件,可以用于程序测试,有喜欢的朋友要多多使用哦(Two check tree traversal file that can be used for program testing)
    2012-07-17 15:18:23下载
    积分:1
  • bfs
    这是BFS算法的实现。用C语言实现的。好好学习吧。(This is achieved BFS algorithm. Implemented using C language. Learn it.)
    2013-12-05 15:56:50下载
    积分:1
  • Poly
    多项式相加的数据结构试验·············(Polynomial sum test data structure)
    2010-12-24 15:11:55下载
    积分:1
  • calc
    这是我在学习数据结构做练习时写的一个小程序,功能是在命令行下进行形如:23+34*3/4+(3*6+10)的四则运算,支持+,-,*,/,(,)进行整数运算。(This is a simple code about data structure.It uses to carry on four arithmetic operations with parenthesis.But now it only supports integer.)
    2009-12-28 12:15:21下载
    积分:1
  • ALGraph
    学数据结构自己总结的东西,希望对大家有所帮助。(Learn data structure sum things up, we want to help.)
    2013-03-08 19:50:18下载
    积分:1
  • yuesefu
    数据结构经典算法 约瑟夫问题 c++ 已经测试通过(josephus c++)
    2012-12-02 16:23:02下载
    积分:1
  • complex
    .h文件。c++中的复数类,能够直接完成基本四则运算,输入输出流,完成一定范围内的比较运算(. H file. c++ classes in the plural, to directly perform basic arithmetic, input and output streams, to complete a range of comparison operators)
    2021-04-25 14:58:46下载
    积分:1
  • queue
    数据结构之队列,完整可运行的一个程序,包含队列的各种操作。(no)
    2009-12-04 21:36:22下载
    积分:1
  • polynomial
    本程序实现一元多项式合并。本程序输入方式为按项输入,每输入一个项,会先提示输入项的幂,再提示输入项的系数。(This procedure combined to achieve a dollar polynomial. This procedure according to entry input methods for the input, one for each input item, it will first prompt entry of the power, and then prompts entry of the coefficient.)
    2009-12-16 17:29:54下载
    积分:1
  • maopao_youhua
    冒泡优化: 如果一个序列是int n[]={1,2,3,4,5,6,7,8,9} , 用正常的冒泡排序需要排8次才行,优化之后1次就好,也就是说序列越接近于正常序列,改进之后的冒泡排序的次数就越少,这样会给一个冒泡排序算法带了很大的效率。 思想:添加一个boolean变量用来判断冒泡是否是已经排好了顺序,如果boolean的值为false,说明是已经排好了,如果boolean的值true,说明没有排好,继续排。(If a sequence is int n [] = {, 1,2,3,4,5,6,7,8,9} need to row 8 times the job after optimization times like normal bubble sort, but alsomeans that the sequence is more close to the normal sequence, improved bubble sort, the less the number, which would give a bubble sort algorithm with a great deal of efficiency. Idea: add a boolean variable used to determine the bubble whether it is already lined up the order, if the boolean is false, indicating already lined up, if the boolean value of true, did not line up, continue to row.)
    2012-04-18 00:33:45下载
    积分:1
  • 696518资源总数
  • 105554会员总数
  • 2今日下载