-
nuaa1108
说明： nuaa1108 多少连续的1 解题报告(Problem solving report
)
- 2009-08-23 10:01:05下载
- 积分：1
-
nuaa1507_DancingLink_trackback.cpp
高德纳发明的高效数据结构dancing link，这里是解重复覆盖问题的一个演示(Donald Knuth invented efficient data structure dancing link, here is the solution to repeat coverage of a demonstration)
- 2010-03-07 10:54:32下载
- 积分：1
-
deep-copy
该代码实现了深拷贝的问题，对于深拷贝进行了一系列的介绍，并且显示其与浅拷贝的区别。(A deep copy of the code issues a series of deep copy for presentation, and shows the difference between a shallow copy.)
- 2014-01-03 10:46:48下载
- 积分：1
-
Euler-algorithm
这是一个实现找出欧拉路径的的算法，比较完美的解决了欧拉算法(This is an implementation of the algorithm to find Euler path, the more perfect solution to the Euler algorithm)
- 2014-07-13 15:20:12下载
- 积分：1
-
PROGRAM
本书是《程序员面试宝典》的第三版，在保留第二版的数据结构、面向对象、程序设计等主干的基础上，使用各大IT公司及相关企业最新面试题替换和补充原内容，以反映自第一版以来近几年时间所发生的变化。 欧立奇、刘洋、段韬编著的《程序员面试宝典》取材于各大公司面试真题(笔试、口试、电话面试、英语面试，以及逻辑测试和智商测试)，详细分析了应聘程序员(含网络、测试等)职位的常见考点。本书不仅对传统的C系语言考点做了详尽解说，还根据外企出题最新特点，新增加了对友元、Static、图形/音频、树、栈、ERP等问题的深入讲解。最后本书着力讲述了如何进行英语面试和电话面试，并对求职中签约、毁约的注意事项及群体面试进行了解析。本书的面试题除了有详细解析和答案外，对相关知识点还有扩展说明。真正做到了由点成线，举一反三，对读者从求职就业到提升计算机专业知识都有显著帮助。 《程序员面试宝典》适合计算机相关专业应届毕业生阅读，也适合作为正在应聘软件行业的相关就业人员和计算机爱好者的参考书。(This book is the" canon" in the third edition, retained in the second version of the data structure, object-oriented program design, main basis, the use of each big IT companies and related enterprises to the latest interview questions substitution and supplement the original content, in order to reflect the since its first edition in recent years since time changes. Ou Liqi, Liu Yang, Duan Tao," canon" drawn from major companies interview questions ( written examination, interview, telephone interview, interview, and logical test and IQ test ), a detailed analysis of the application programmer (including network, testing ) positions of the common points. This book not only to the traditional C language test done a detailed explanation, according to the new characteristics of the new foreign title, added to the friend, Static, graphics/audio, tree, stack, ERP issues in depth explanation. The last book on described how the English interview and telephone interview, and the job of signin)
- 2012-03-21 11:28:19下载
- 积分：1
-
backtrackng
给定n种物品和一背包。物品i的重量是wi>0,价值为vi>0,背包的容量为c。选择装入背包的物品，使得装入背包中物品的总价值最大。(Given n kinds of goods and a backpack. Weight of the item i is wi> 0, the value of vi> 0, knapsack capacity c. Select the items into the backpack, so into the backpack of items in the total value of the maximum.)
- 2017-01-01 17:51:23下载
- 积分：1
-
zhan
队列的顺序存储结构和操作实现
队列的顺序存储结构和操作实现(The order of the queue storage structure and operation of the order of the realization of the queue storage structure and operation of the realization of)
- 2008-12-11 20:10:49下载
- 积分：1
-
hanoi
实现汉诺塔的操作步骤输出，可以设置1，2，3三个塔柱，输出结果为用1，2，3表示的操作(Tower of Hanoi the steps to achieve the output, you can set 1,2,3 3 Pylon, the output result of the operation that used 1,2,3)
- 2009-12-05 22:11:52下载
- 积分：1
-
select
采用Dijkstra算法和Floyd算法实现的简单医院选址系统(data structure)
- 2009-03-11 20:23:09下载
- 积分：1
-
listnode
C++中，对链表的增删改查的基本使用，值得学习(C++, on the list of CRUD basic use, it is worth learning)
- 2015-08-05 17:57:12下载
- 积分：1
