付某人的博客

实现顺序表的增 删 改 查 插入 修改package com.Test.Demo.数据结构;import java.util.Scanner;/** * @Author Fu XvZhuang * @Date 2020/9/13 11:32 * @Version 1.0 */public class 顺序表 { public static void main(String[] args){ Scanner sc = new Scanner(System.in);

package com.数据结构;import java.util.ArrayList;import java.util.Collections;public class 哈夫曼树 { //将数列转成哈夫曼树 public static void main(String[] args) { int[] arr = new int[]{13,7,8,3,29,6,1}; ArrayList<NodeTree> list = new Arra

package com.数据结构;import javax.xml.soap.Node;public class 二叉树 { //实现二叉树的前序遍历 中序遍历 后序遍历 前序查找 中序查找 后序查找 public static void main(String[] args){ Node01 n1 = new Node01("老大",1); Node01 n2 = new Node01("老二",2); Node01 n3 = new

package com.数据结构;import java.util.Hashtable;import java.util.Scanner;public class 哈希表 { //分别采用取模法 和idea实现哈希表 public static void main(String[] args) { Scanner sc = new Scanner(System.in); String str; Hashtabl hash = new H

package com.数据结构;import java.util.Scanner;public class 栈 { public static void main(String[] args){ boolean flag = true ; Stack stack = new Stack(5); Scanner sc = new Scanner(System.in); while(flag){ Syste

package com.数据结构;import java.util.Scanner;public class 环形链表_约瑟夫环 { //有n个人围成一圈，顺序从1开始排号。从第m个人开始报数（从1到3报数），凡报到k的人退出圈子. // 问最后留下的是原来第几号的那位。要求用循环链表实现。 //环形链表 (约瑟夫环) ----- 其实没学数据结构之前我就用环形链表做出来了，hahahhah public static void main(String[] args)

package com.数据结构;public class 双向链表 { public static void main(String[] args){ Node2 node1 = new Node2(1,"宋江","及时雨"); Node2 node2 = new Node2(5,"林冲","豹子头"); Node2 node3 = new Node2(1,"宋江","及时雨"); Node2 node4 = new Node2(

package com.数据结构;public class 单向链表 { public static void main(String[] args) { Node node1 = new Node(1,"宋江","及时雨"); Node node2 = new Node(5,"林冲","豹子头"); Node node3 = new Node(1,"宋江","及时雨"); Node node4 = new Node(3,"吴用",

package com.数据结构;import java.util.Scanner;public class 环形队列 { public static void main(String[] args){ LinkedArray queue = new LinkedArray(5); Scanner scanf = new Scanner(System.in); boolean flag = true; while(flag){

package com.数据结构;public class 稀疏数组 { public static void main(String[] args) { int[][] a = new int[11][11]; //原始数组的创建 a[1][3] = 1; a[2][4] = 2; a[3][3] = 1; a[3][4] = 2; int sum = 0; for(int[] r