公交车管理系统(javascript+struts)

利用文件实现数据存取的学生成绩管理系统

An immutable hash-based multiset. Does not permit null elements.

用java语言实现TEA，可以处理任意轮数的TEA，过程清晰，界面简单(Using java language TEA, can handle any number of rounds of TEA, the process is clear, simple interface)

设计模式一（单子、工厂、策略模式）练习 1． 假设现在要设计一个贩卖各类书籍的电子商务网站的购物车系统。对所有的教材类图书 实行每本一元的折扣；对连环画类图书提供每本7%的促销折扣；而对非教材类的计算机图书有3%的折扣；对其余书没有折扣。使用策略模式、工厂模式、单子模式进行设计(Design Mode 1 (List, Factory, Strategy Mode) Exercise 1. Suppose we are going to design a shopping cart system for e-commerce websites that sell all kinds of books. All textbook books are discounted at one yuan per book; comic books are discounted at 7% per book; computer books are discounted at 3% for non-textbook books; and other books are discounted at no rate. Design using strategy mode, factory mode and single mode)

说明：  用java实现的桶排序程序,本科期间java的实习(used to achieve the barrels sequencing procedures, undergraduate internships during java)

Note: the test case uses a temp text file named "test" which contains 31 characters : "P@ABCDEFGHIJKLMNOPQRSTUVWXYZ[]".

记账：记录收入支出情况，随时可查看账单明细(Bookkeeping: recording income and expenditure, the details of the bill can be viewed at any time)

test my program hello world zheng

ViewPager的滑动，以及图标的变动，(ViewPager use)

题目：打印出杨辉三角形（要求打印出10行题目：输入3个数a,b,c，按大小顺序输出。 题目：输入数组，最大的与第一个元素交换，最小的与最后一个元素交换，输出数组。 题目：有n个整数，使其前面各数顺序向后移m个位置，最后m个数变成最前面的m个数 题目：编写一个函数，输入n为偶数时，调用函数求1/2+1/4+...+1/n,当输入n为奇数时，调用函数1/1+1/3+...+1/n(Topic: Print out the Triangle (10 lines required to print out the Title: Enter the 3 numbers a, b, c, according to the order of output. Title: input array, the largest exchange with the first element, the smallest and the last element of the exchange, output array. Topic: There are n integers, to move back in front of the order m of the number of positions, finally becoming the foremost m m the number of number of topics: write a function, the input n is even, the call function evaluation 1/2+1/4+...+ 1/n, when the input n is odd, call the function 1/1+1/3+...+ 1/n)