牛客独家春招实习备战手册-技术篇

说明：  编写程序测试用户输入的英文字符串是不是回文。忽略所有的空格的标点符号，并忽略字母的大写和小写形式。(Write a program to test whether the English string entered by the user is palindrome. Ignore all space punctuation and the upper and lower case forms of letters.)

说明：  FOREX ROBOT DECOMPILE

堆栈的基本应用（用于通讯录）适于初学者加深对其理解学习。-The basic application of the stack (for address book) for beginners to learn to deepen their understanding.

adempiere coockbook, howot customize adempiere

用于确将CAD图纸中的局部提出出来的CAD插件，非常好用。(The CAD plug-in, which is used to confirm the local presentation of the CAD drawing, is very easy to use.)

说明：  旅行商问题(TravelingSalesmanProblem，TSP)是一个经典的组合优化问题。经典的TSP可以描述为：一个商品推销员要去若干个城市推销商品，该推销员从一个城市出发，需要经过所有城市后，回到出发地。应如何选择行进路线，以使总的行程最短。从图论的角度来看，该问题实质是在一个带权完全无向图中，找一个权值最小的Hamilton回路。由于该问题的可行解是所有顶点的全排列，随着顶点数的增加，会产生组合爆炸，它是一个NP完全问题。(Traveling Salesman Problem (TSP) is a classic combinatorial optimization problem. The classic TSP can be described as: a merchandiser sells goods to several cities. The salesman starts from a city and needs to go through all the cities and return to the starting point. How to choose the route of travel so that the total journey is the shortest. From the point of view of graph theory, the essence of the problem is to find a Hamilton loop with the smallest weight in a completely undirected graph with weights. Since the feasible solution to this problem is the full permutation of all vertices, as the number of vertices increases, a combinatorial explosion occurs, which is an NP-complete problem.)

说明：  PB开发的能自由控制图形的程序PB开发的能自由控制图形的程序(PB free to control the graphics development process)

Tool editor for dbv s2 neosat

说明：  MapReduce 中WordCount java代码实现(Implementation of wordcount java code in MapReduce)

VB qq空间留言工具，init模拟发送数据包，模拟腾讯MD5加密传输账号密码(VB the qq space Message tool, init simulated send packets analog Tencent MD5 encrypted transmission account password)