链式结构堆栈类的类模板实现及用堆栈类求解N皇后问题

本程序用分支界限方法解决ＴＳＰ问题，即旅行商问题．-the procedures used branch line solution to TSP, the traveling salesman problem.

在一台机器上只能处理n个作业，每个作业均可在单位时间内完成，又假定每个作业都有一个截止期限，当且仅当作业i在它的截止期限之前完成时，可以获得一定的效益。 给定作业序列，要求一种作业排序算法，使获得的总效益值最大。 -On a single machine can handle only n-jobs, each job can be completed within the unit, but also assumes that each job has a deadline, if and only if job i in its completed before the deadline, they can to receive some benefits. For a given job sequence, requires a job sorting algorithm, so that the greatest value of total benefits received.

本人的ssd7的练习3的答案， 供大家参考， 希望大家喜欢-ssd7 exercise3

数据结构 链表 按顺序合并两链表。 pa =1 2 4 7 9 11 16 pb= 1 6 9 23 24 36 1 1 2 4 6 7 9 11 16 23 24 36-link

可以在打印之前并在程序内直接设置所有的参数!-in print before the procedure and direct all the parameters set!

一元多项式的计算,建立两个多项式，并进行相加，相减运算，输出结果.参考资料：严蔚敏《数据结构与算法》-one yuan polynomial calculations, the establishment of two polynomials, and together, subtract operation, the output results. References : Yan Wei Min "data structure and algorithm"

钱能C++习题答案-money can answer the questions

Skiplist 跳表 c++ 实现， 包含vs工程文件， Skiplist.h 代码文件 和 TestMain.cpp 测试文件，主要应用实现有序集，效率接近树，但实现简单， redis内部也有skiplist的实现

这个类，使数据库编程变的更简单-this category, the database programming change simpler

本人制作的8位CPU,有简单的加减,输入,输出操作,希望大家好用-I produced eight CPU, has a simple addition and subtraction, input and output operations, I hope everyone use