资源列表
SimpleThreads
- JAVA 多线程 下载 程序 选择保存地址 下载完 显示文件信息
huffmancodeimplementation
- Huffman s compression algorithm implemented in Javascr ipt. 2009-06-02 implemented Huffman s compression algorithm in Javascr ipt. Here is a wiki link describing what Huffman coding is: http://en.wikipedia.org/wiki/Huffman_coding My working e
ririli
- 简单的日历：应用基本的三个事件。 日历美观，可以选择日、周、月、显示选择的日期。-Simple calendar: The basic three events. Beautiful calendar, you can choose day, week, month, shows the selected date.
UDPtalk
- 简单的UDP通信,实现了利用UDP通信，有客户端，服务器端。比较简单-UDP Comunicate
chatClient
- java开发的聊天室客户端，实现了简单的窗口-ChatroomClient
ibm
- 输入你的体重，以及你的身高，系统根据bmi指数会分析你是否超重-Enter your weight and your height, the system will be analyzed according to bmi index if you are overweight
FrogLeap
- 青蛙问题的说明，找到最终状态后通过prev输出跳跃的全过程-Frog descr iption of the problem, find out the final state after the jump through the whole process prev
huangjinka
- 有三张卡，其中两张银卡，一张黄金卡，放在把背面提供给竞猜者来猜，本节目存在三种选择方法。 方法一：在竞猜者随机三选一后，不再改变选择的结果； 方法二：在竞猜者随机三选一后，主持人再翻开剩下两张中没有被选中的一张银卡，竞猜者再重新在剩下的两张卡中随机选择。 方法三：在竞猜者随机三选一后，主持人再翻开剩下两张中没有被选中的一张银卡，竞猜者改变原来的选择，选取剩下的唯一那张没有翻开的卡。 -There are three cards, two of which Silver, a g
bigTuan
- 算法分析与设计 最大团问题 G的最大团是指G中所含顶点数最多的团。 无向图的最大团和最大独立集问题都可以看作是图G的顶点集V的 子集选取问题可以用回溯法在O(n*(2^n))时间内解决。-Algorithm analysis and design problem G, the biggest group the biggest group is the maximum number of vertices of G contained in the group. Undirect
js
- 一个简单的当前行前后添加行~~删除特定行的JS-A simple before and after the current line add a row to delete a specific line of JS
AllowEventsHeader
- List of AllowEvents headers for Java.
AnnotationTypeMismatchException
- Indicates that an notation type has changed since it was compiled or serialized for Andriod. -Indicates that an annotation type has changed since it was compiled or serialized for Andriod.