- 博客(25)
- 资源 (4)
- 收藏
- 关注
RSS订阅原创 jsp页面内容显隐总结
选中grid某条记录按钮显隐< open:grid property ="record" caption ="查询结果" width ="100%" keylist ="zhuanjia_id" nowrap ="true" navbar ="top" fixrow ="true" sortColumn ="*" onselect ="func_grid_select()">function fu
2016-03-17 09:07:22
1428
原创 快速排序二
public class ArrayIns { private long[] theArray; private int nElems; public ArrayIns(int max){ theArray=new long[max]; nElems=0; } public void insert(long value){
2016-03-15 17:05:01
751
原创 快速排序一
public class ArrayIns { private long[] theArray; private int nElems; public ArrayIns(int max){ theArray=new long[max]; nElems=0; } public void insert(long value){
2016-03-15 16:44:26
771
原创 划分算法
public class ArrayPar { private long[] theArray; private int nElems; public ArrayPar(int max){ theArray=new long[max]; nElems=0; } public void insert(long value){
2016-03-15 16:01:32
1385
原创 希尔排序
public class ArraySh { private long[] theArray; private int nElems; public ArraySh(int max){ theArray=new long[max]; nElems=0; } public void insert(long value){
2016-03-15 14:05:23
1106
原创 非递归实现归并排序
归并算法的中心是归并两个已经有序的数组public class MergeApp { /** * @param args */ public static void main(String[] args) { // TODO Auto-generated method stub int[] arrayA={23,47,81,95};
2016-03-14 11:33:33
1198
原创 汉诺塔问题
对于上面把问题抽象出来的那段描述，对于n > 1的时候，又可以抽象（换成“总结”这个词会没那么大压力吗？）出这3步： (1)、将底盘n以上的环（n-1个）移动到B (2)、将底盘n从A移动到C (3)、将B上的环（n-1个）移动到C 其中第1步和第3步的步数是一样的，因为环的数量一样（n-1个），只是目标的柱子不同而已。public class TowerApp { /**
2016-03-14 11:05:19
1099
原创 递归求三角数字
package cn.gwssi;import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;public class TriangleApp { /** * @param args */ static int theNumber;
2016-03-14 09:58:29
1084
原创 Josephus问题
public class Link { public long lData; public Link next; public Link(long lData){ this.lData=lData; } public void displayLink(){ System.out.print(lData+" "); }}p
2016-03-11 15:19:07
736
原创 循环链表实现队列
public class Link { public long lData; public Link next; public Link(long lData){ this.lData=lData; } public void displayLink(){ System.out.print(lData+" "); }}pu
2016-03-11 14:47:28
1350
原创 循环链表
public class Link { public long lData; public Link next; public Link(long lData){ this.lData=lData; } public void displayLink(){ System.out.print(lData+" "); }}pu
2016-03-11 14:26:57
694
原创 基于双向链表的双端队列
public class Link { public long dData; public Link next; public Link previous; public Link(long dData){ this.dData=dData; } public void displayLink(){ System.out.p
2016-03-10 16:32:07
975
原创 基于有序链表的优先级队例
public class Link { public long lData; public Link next;//reference to next Link public Link(long lData){ this.lData=lData; } public void displayLink(){ System.out.pr
2016-03-10 16:12:54
790
原创 双向链表
public class Link { public long dData; public Link next; public Link previous; public Link(long dData){ this.dData=dData; } public void displayLink(){ System.out.p
2016-03-10 15:43:10
551
原创 数组利用有序链表排序
public class Link { public long lData; public Link next;//reference to next Link public Link(long lData){ this.lData=lData; }}public class SortedList { private Link first;
2016-03-10 11:44:21
796
原创 数字转换成中文汉字
public class NumberUtils { public NumberUtils(){ } public static final String[] UNITS={"","十","百","千","万","十","百","千","亿","十","百","千"}; public static final String[] NUMS = {"零","一","二",
2016-03-10 11:34:26
1094
原创 win7配置免安装mysql
通过cmd进入mysql解压目录bin目录中，执行如下命令：mysqld install mysqltest --defaults-file="E:\Develop\mysql-5.6.19-winx64\test.ini"【mysqltest为添加的服务名】删除已注册的服务指令：sc delete mysqltest
2016-03-10 10:36:04
496
原创 有序链表
public class Link { public long lData; public Link next;//reference to next Link public Link(long lData){ this.lData=lData; } public void displayLink(){ System.out.pr
2016-03-03 17:31:51
589
原创 链表实现队列
public class Link { public long lData; public Link next;//reference to next Link public Link(long lData){ this.lData=lData; } public void displayLink(){ System.out.pr
2016-03-03 16:07:18
555
原创 用链表实现栈
public class Link { public long lData; public Link next;//reference to next Link public Link(long lData){ this.lData=lData; } public void displayLink(){ System.out.pr
2016-03-03 15:50:08
566
原创 双端链表
public class Link { public long lData; public Link next;//reference to next Link public Link(long lData){ this.lData=lData; } public void displayLink1(){ System.out.
2016-03-03 15:03:55
497
原创 单链表
public class Link { public int iData;//data public double dData;//data public Link next;//reference to next Link public Link(int iData,double dData){ this.iData=iData; th
2016-03-03 14:47:01
518
原创 栈应用——分隔符匹配
public class StackX { private int maxSize; private long[] stackArray; private int top; public StackX(int s){ maxSize=s; stackArray = new long[maxSize]; top=-1;
2016-03-03 10:53:43
529
原创 栈应用——单词逆序
public class StackX { private int maxSize; private long[] stackArray; private int top; public StackX(int s){ maxSize=s; stackArray = new long[maxSize]; top=-1;
2016-03-01 14:16:33
756
原创 队列Queue模拟排队问题
4.5 队列通用于模拟人、汽车、飞机、业务等等的流动情况。应用queue.java 程序（清单4.4）的Queue类，编写一个程序模拟超市的收款队列。可以用上机 作业4.1的display()方法，显示出顾客的几条队列。可以通过敲击一个键插入 一个新的顾客。为顾客选择在哪一个队列上。收银员为每个顾客服务的时间是 随机的（可假定为按照顾客买了多少东西而定）。一旦结完账，就从队列中删 除该顾客。为了简单
2016-03-01 10:15:22
8701
1
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人