ZookeeperClient

覆盖了基本常用的机器学习算法。包括线性回归与分类算法；决策树；多种降维算法；优化算法；强化学习等多类算法的Python代码。(It covers the commonly used machine learning algorithms. Including linear regression and classification algorithm; decision tree; a variety of dimensionality reduction algorithm; optimization algorithm; reinforcement learning and other algorithms of Python code.)

运筹学大作业：实现多条件最大运筹与最小运筹的最佳方案计算与价值预测(Operational Research Big Operation: the Best Scheme calculation and value Prediction for realizing Multi-condition maximum and minimum operational Research)

拷贝和排序,本程序能实现A[N]与B[M],其中这两个数组都按升序排列,合并为一个C[M+N]数组,且按升序排列,()

适合Java初级学者的滴滴打车系统选择出发地址和目的地，会寻找最短路径，进行最低消费。根据走的路径的距离来判断收费的情况，可以随时更新出租车司机的基本信息，以及车辆的维修情况

一种有效的包络线算法,可以实现很多情况下的振动信号的包络线生成,(An effective envelope algorithm can be used to generate envelope of vibration signal in many cases.)

基于安卓系统的数据库使用源代码教程，编译验证可行(Android-based tutorial database using the source code, compile proven feasible)

分布式系统停车场问题：某停车场共有TOTAL-NUM个车位, ENTRY-NUM个入口, EXIT-NUM个出口. 现需要一个用于停车场控制汽车进出的分布式系统, 在该系统中没有集中的管理者(central server), 每个进(出)口通过通信平等协商保存当前车库的状态信息(如空闲车位数UNOCCUPIED-NUM等), 并据此决定是否允许车辆进入, 为简便计, 假定通信是可靠的.(Parking issues distributed systems: A total of TOTAL-NUM parking spaces, ENTRY-NUM entrance, EXIT-NUM export. Is the need for a used car out of the car park of the distributed control system, the system does not focus on manager (central server), for each import (export) through consultations on an equal footing Communication garage to preserve the current status information (such as the number of free parking spaces UNOCCUPIED-NUM, etc.), and, accordingly, whether or not to allow vehicles to enter, for the simple, the assumed that the communication is reliable.)

求最长公共子序列。本算法使用动态规划算法，解得最长公共子序列问题。(Find the longest common subsequence. The algorithm uses a dynamic programming algorithm, the solution was the longest common subsequence problem.)

在进行测试的过程中，我们测量的数据并不会是完整的，但是通过我们的程序进行筛选，我们能过获得一套完整的数据，便于我们后期的分析和使用。在信号测量方面的数据筛选代码。

学生选课系统，用的java写的，之前做的项目，也有不足的地方希望大家不要介意(Student elective system, with the java to write, before doing the project, there are insufficient places hope that we do not mind)