资源列表
BookStore
- 图书管理系统,ssh框架搭建,图书管理上传功能,图书管理功能,用户管理功能等。-Books management system management system, set up SSH framework, uploading books management, books management function, the user management function, etc.
The-sum-
- Java编程之方阵对角线之和,代码不对的地方,可自行修改,不过我自己实验的都对-Java programming of the sum of square diagonally, code wrong, can modify, but all of my own experiments
Shoppingchart
- 一个简单的购物车,可以很快让程序员学会的-A simple shopping cart, you can quickly learn to let programmers
chat
- 简易的通讯软件,里面有服务端和客户端,合肥工业大学Java课可能需要,不必要的代码,可以自行删除修改-Simple and easy communication software, there are server and client, Java classes may need to hefei university of technology, unnecessary code, can be modified to delete
calculator
- 一个简易的Java计算器源代码,合肥工业大学有用到过,很容易懂,可以自行修改,编译通过,代码没错-A simple Java calculator source code, useful to the hefei university of technology, it is easy to understand, can modify, compile, code that s right
kindeditor
- 一个很好用的网页编辑器,使用到现在,支持AJAX上传。-Web page editor of a well used, use up to now, support AJAX upload.
Test
- 一款可以随机出题并且可以判断是否做对的源代码,我是一名普通的学生,技术不过关想要通过贵网站好好学习,望恩准。-A random set of code
CountLettersInArray
- 随机产生一个字符数组。查找并统计数组中出现哪几种字符以及每种字符出现次数,并且显示出来。-Randomly generated a character array. Find and statistical the kinds of characters and each character occurrences, than display them.
ComputeChange
- 将整钱兑换成零钱,输入需要对话钱数,显示输出可兑换为多少元、角、分。-Change the entire money, input amount according to how much you need to change, output the result of the change.
SelectionSort
- 对数组进行升序排序。进行n层循环,每次循环选出最大数,记录最大数值以及下标,与最右边数值进行交换。-An array in ascending order. N-tier cycle, each cycle to the maximum number and records maximum value and the subscr ipt, exchange with the right values.
TowerOfHanoi
- 汉诺塔游戏攻略,用户输入汉诺塔中需要移动的盘子总数,程序输出移动盘子的方法步骤。-Hanoi game strategy, the user enters the total number of Hanoi tower needed moving plates, the program outputs mobile steps .
udpSend-and-udpRecv
- java 语言的一对简单的UDP通信,通过udpSend实现发送,udpRecv实现监听,一个简单的例子,帮助理解Udp的套接字的用法-by using the java Language,a pair of udp multiple connection,you can learn the use of socket
