scropio0zry的博客

//10-10 今天看了数据结构中线性表的顺序存储结构部分,用java代码写了一个简单的结构public class LineList { int maxsize = 20; String[] data = new String[maxsize]; int length; public static void main(String[] args) { LineList L =

//定义顶点结点public class Vertex { private char vertex; private Side side; public Vertex() { super(); this.vertex = '\0'; this.side = null; // TODO Auto-generated constructor stub } public Ve

import java.util.Scanner;//邻接矩阵(图)public class MyGraph { int MAX_SIZE = 100; // 定义一个一维数组存储顶点 final static int INFINITE = Integer.MAX_VALUE; char[] vex; // 定义二维数组存储边 int[][] side; // 边的数量 in

package myhuffman;//哈夫曼树结点的建立public class TreeNode { //结点数据 private Object data; //结点权值 private int count; private TreeNode lchild; private TreeNode rchild; public TreeNode(){} p

//线索二叉树的实现public class ThreadBinTree { // 定义结点类 class TreeNode { private Object data; private TreeNode lchild; // 判断左孩子是否为线索 private boolean ltag; private TreeNode rchild; // 判断右孩子是否为线

public class BFArithmetic { public static void main(String[] args) { Scanner sc = new Scanner(System.in); System.out.println("请输入一段长字符串: "); String big = sc.nextLine(); System.out.println("请输

//顺序结构的队列(循环队列)public class SeQueue { public static void main(String[] args) { cycleQueue c = new cycleQueue(); c.pushQuere(1); c.pushQuere(2); c.pushQuere(3); c.pushQuere(5); c.pushQuer

import java.util.Arrays;import java.util.Scanner;//简易计算器的编写 //中缀表达式转后缀表达式 ,得出结果用于逆波兰数输出//例如 输入:(11+2.2)*3.1+(30*45)-((1.1+23)*3.3)/5.2//转换成后缀表达式: 11 2.2 + 3.1 * 30 45 * + 1.1 23 + 3.3 * 5.2 /

//链栈结构public class myStackNode { public static void main(String[] args) { StackNode S = new StackNode(); S.stackPop(); S.listStack(); } //建立链栈 public static class StackNode{ //top指针指向栈顶

import java.util.Arrays;import java.util.Scanner;//10-21逆波兰表达式计算器public class RPN { public static void main(String[] args) { Scanner sc = new Scanner(System.in); // 将输入的字符串转换成一个字符数组 System.

//应用:将二进制转换成十进制//顺序栈的实现public class myStack { public static void main(String[] args) { ArrayStack S = new ArrayStack(3); //二进制为整数时,转换成十进制 int num = 1010; int decimal = S.transDecimal(num);

//双向循环链表public class DLineListNode { public static void main(String[] args) { DLineList L = new DLineList(); L.addDNode(1); //L.addDNode(3); //L.addDNode(1, 2); L.deleteNode(1); L.list()

import java.util.Scanner;//头结点的单向循环链表public class SLineListNode { public static void main(String[] args) { System.out.println("1.查看链表"); System.out.println("2.创建链表"); System.out.println("3.清

//josephus问题 41个人1-3报数,数到3的自杀,最后剩余的2个人结点数据public class Josephus { public static void main(String[] args) { SLineList s = new SLineList(); //定义人数m int m = 41; s.init(); //建立一个有m个结点的循环链表 f

//10-14 数据结构中带有头结点的单链表结构,用java语言简单实现public class LineListNodeHead { public static void main(String[] args) { LineList L = new LineList(); L.addNodeH(1); L.addNodeH(2); L.addNodeF(3); L.

//10-12 数据结构中没有头结点的单链表,用java语言简单实现public class LineListNode { public static void main(String[] args) { LinkedList L = new LinkedList(); L.CreateNode(); L.addNodeF(1); L.addNodeF(2); L.ad

/** * Author:scorpio0zry * * 功能:用java创建十字链表 表示有向图 * * */public class CrossGraph { int vexL; // 顶点数量 int sideL; // 边的数量 Vertex[] vertexs; // 顶点数组 // 定义顶点结点 private class Vertex { char