整洁的代码

实用数据结构教程,让你学习数据结构不用愁,呵呵!希望这对你有用,能帮上一点忙!-Practical Guide data structure, so you learn not worry about data structures, Oh! Hope this useful to you, we can help!

还可以啦!!有问题请讲-can! ! There are problems, please

算法分析，算法理解，算法性能分析，算法综述等等。-Algorithm analysis, algorithm understanding, algorithm performance analysis, algorithm, etc..

一元稀疏多项式计算器[加法和乘法] 问题描述： 设计一元系数多项式计数器实现两个多项式间的加法、减法。 基本要求： （1） 输入并建立多项式 （2） 输出多项式，输出形式为整数序列：n，c1，e1，c2，e2……cn，en，其中n是多项式的项数，ci，ei分别为第i项的系数和指数。序列按指数降序排列。 （3） 多项式a和b相加，建立多项式a+b，输出相加的多项式。 （4） 多项式a和b相减，建立多项式a-b，输出相减的多项式。 用带表头结点的单链表存储多项式。 测试数据： (1) (2x+5x8-3.1x11)+(7-5x8+11x9) (2) (6x-3-x+4.4x2-1.2x9)-(-6x-3+5.4x2+7.8x15) (3) (x+x2+x3)+0 (4) (x+x3)-(-x-x-3)-one yuan sparse polynomial calculator [Addition and multiplication] Problem description : Design one yuan polynomial coefficient counter achieve the two polynomials addition, subtraction. Basic requirements : (a) input and the establishment of polynomial (2) output polynomial, the output form of integer sequence : n, c1, e1, c2, e2 ... cn, en, where n is the polynomial Number, ci, ei for the first item i the coefficients and indexes. By sequencing index in descending order. (3) a and b polynomial addition, the establishment of a polynomial b, the combined output polynomial. (4) a and b polynomial subtraction, the establishment of a polyno

Its about data structure Tr-Its about data structure Tree

够你们交作业了-enough perpendicular operation of the Ha Ha

算法，钱币组合。可设定钱币种类数量，找出组合种数。-Algorithm, coin combinations. Can set the number of coin types, identify the combination of species.

精密单点定位程序,需要下载精密星历与精密接手记钟差!-precision single-point positioning procedures need to download precise ephemeris and sophisticated access Notes bell worse!

北大在线OJ 1100题，运用自动机成功求解方程式的经典例子，此程序可作为自动机模板-OJ 1100 North online title, the success of the use of automata to solve the classic example of the equation, this procedure can be used as a template automaton

这份是数据结构的一些资料，里面内容相对比较简单，但却非常值得一看～-This is some of the information data structure, which content is relatively simple, but very much worth a visit ~