
Java
MeetBetterMe
这个作者很懒,什么都没留下…
展开
-
java 链表实现
package lianbiao;import java.util.Scanner;/*define CL data class*/class DATA2{ String key; String name; int age;}/*define CL data class*//*define CL structure*/class CLType{ DATA2 nodeD转载 2015-03-15 13:17:07 · 355 阅读 · 0 评论 -
java 图
package tu;import java.util.Scanner;class GraphMatrix{ final int MAXVALUE = 65535; static final int MaxNum = 20; char[]Vertex = new char[MaxNum];//保存顶点信息 int GType;//图的类型(0:无向图;1:有向图) int Vert转载 2015-03-21 19:56:23 · 437 阅读 · 0 评论 -
java 栈实现
package zhan;import java.util.Scanner;class DATA3{ String name; int age;}class StackType{ static final int MAXLEN = 50; DATA3[]data = new DATA3[MAXLEN+1]; int top; @SuppressWarnings("unu转载 2015-03-15 15:28:15 · 387 阅读 · 0 评论 -
java 队列实现
package duilie;import java.util.Scanner;class DATA4{ String name; int age;}class SQType{ static final int QUEUELEN = 15; DATA4[]data = new DATA4[QUEUELEN]; int head; int tail; @SuppressW转载 2015-03-19 20:42:38 · 364 阅读 · 0 评论 -
java 二叉树
package erchashu;import java.util.Scanner;class CBTType{ String data; CBTType left; CBTType right;}public class BinaryTree{ static final int MAXLEN = 20; static Scanner input = new Scanner(转载 2015-03-20 23:30:56 · 401 阅读 · 0 评论