huangyinge的专栏

这是一个简单的j2me公交查询系统，是利用JSP来做的。已经实现了一次查询，剩下的二三次查询你可以自己完善。

use java to realize the huffman coding and the recoding.

L1=new Label("请输入物品的个数："); L2=new Label("请输入物品的重量："); L3=new Label("请输入物品的价值:"); L4=new Label("请输入背包容量："); L5=new Label("物品装入情况："); L6=new Label("背包的总重量："); L7=new Label("装入物品的总价值："); tf1=new TextField(5); tf2=new TextField(25); tf3=new TextField(25); tf4=new TextField(5); tf5=new TextField(25); tf6=new TextField(5); tf7=new TextField(5); button=new Button("计算最优值");

public String up(String number, boolean updown) { int i = 0; String s = ""; StringTokenizer tokenizer = new StringTokenizer(number, ","); Array = new double[tokenizer.countTokens()];//字符串的解析,计算在生成异常之前可以调用此 tokenizer 的 nextToken 方法的次数/ while (tokenizer.hasMoreTokens()) { String d = tokenizer.nextToken(); Array[i] = Double.valueOf(d);//将字符串转换为双字节类型 i++; } QSort(Array, 0, Array.length - 1);// 调用快速排序（升序） if (!updown) { double num; int low = 0, high = Array.length - 1; for (; low < high; low++, high--) { num = Array[low];//数组交换位子 Array[low] = Array[high]; Array[high] = num; } } for (i = 0; i < Array.length - 1; i++) { s += String.valueOf(Array[i]) + "，"; } return s + String.valueOf(Array[Array.length - 1]); } public int searchNumber(double num, boolean updown) {// 折半查找算法 int left = 0, right = Array.length - 1, middle = -1; while (left <= right) { middle = (left + right) / 2; if (num == Array[middle]) return middle; if (updown) {//如果数组是升序 if (num > Array[middle]) left = middle + 1; else right = middle - 1; } else {//数组是降序 if (num >Array[middle]) right = middle - 1; else left = middle + 1; } //return middle; } return -1; }

政府行政事业机关单位网站管理系统正式版，是个很好的模板啊！