leetcode可过OJ的Java代码

8数码问题，asdfghjk，mnsdfghjo8765edfghjkxcvbnm poiuytrewq; lkjhgfds/，mnbvcx用户名：EAV-0109785329。密码：j4fpa4usdk用户名：EAV-0109785328密码：x5rve9k97t用户名：EAV-0109785326密码：6hjj65m39s用户名：EAV-0109785378密码：h7k8jvn3je用户名：EAV-0109785375密码：cuhattk8he用户名：EAV-0109785373密码：exx6s4a39a

能实现16位的快速傅立叶变化,位数可自由设定,输出斜波可调整个数-Can realize the fast Fourier 16 changes in the median can be free to set up, the output ramp adjustable number of

应用背景程序求解完全的二维N-S方程，考虑了粘性和导热。当来流Mach数为4时，计算结果与书上的结果一致，然而，我的程序不能计算Mach数为25的情况（即书中提供的另一种工况的比较结果），经过仔细检查，我认为自己的程序没毛病，可能是书中求解步长的公式给错了（eq.(10.16) in p.457），还望大家帮助检查一下。最后还要说明的是，该章在指导你写程序时，书上有些关键地方有印刷错误，会误导你，一定要小心。参考文献：Chapter 10, Computational Fluid Dynamics, The Basics with Applications, John D. Anderson, JR. McGraw-Hill, 2002, 4 《Anderson计算流体力学入门》 关键技术         bc.f---------------------边界条件          conver.f-----------------迭代收敛判断          dynvis.f-----------------计算粘性项          mac.f--------------------MacCormack求解器          mdot.f-------------------质量守恒判断          output.f-----------------结果输出          qcx.f,qcy.f--------------计算导热项          tauxx.f,tauyy.f,tauxy.f--计

a_star_pathfinder A星路径寻找可以用来学习寻路的方法 可以用到很多地方 比如脱机的AI寻路就可以用到他 -a_star_pathfinder A Star path finding can be used to study routing methods can be used in many places such as the AI offline Wayfinding can be used on him

5个关于布尔运算的C程序，以及示例，来自《C语言数值常用程序》，所以程序均经过本人测试可以正常使用！-five Boolean operations on the C procedures, as well as examples from the "C language commonly used numerical procedures," and so I have to undergo testing can be used normally.

％ [nearest_neighbours] = find_nearest_neighbours( database, desc, max_dist ) ％ Find the indices of the nearest neighbours of the given desriptors in the近邻点寻找算法，在非线性时间序列中很有用，是常用的算法- [Nearest_neighbours] = find_nearest_neighbours (database, desc, max_dist) Find the indices of the nearest neighbours of the given desriptors in the neighbor-point search algorithm, the nonlinear time series of very useful, is a commonly used algorithm

This the Luhn algorithm used to verify card numbers throughout the world. -This is the Luhn algorithm used to verify card numbers throughout the world.

用C++编写的五子棋游戏

对以下6种常用的内部比较排序算法进行比较，气泡排序，直接插入排序、简单选择排序、快速排序、shell排序、堆排序。

Java实现的快速自相关算法:提供交互界面,可读入外部数据文件-Java"s rapid auto-correlation algorithm : to provide interfaces to external data into readable document