zhihuiHelloWorld的博客

package DataStructTest.csdn; import java.util.Arrays; public class 希尔排序 { public static void main(String[] args) { int[] arr = {99, 5, 69, 33, 56, 13, 22, 55, 77, 48, 12, 88, 2,69,99}; xierSort(arr); System.out.println(Arrays.

package DataStructTest.csdn; import java.util.Arrays; public class 插入排序 { public static void main(String[] args) { int[] arr = {5, 8, 6, 3, 1}; CharuSort(arr); System.out.println(Arrays.toString(arr)); } public stati.

package DataStructTest.csdn; import java.util.Arrays; public class 选择排序 { public static void main(String[] args) { int[] arr = {5, 9, 6, 8, 2, 1}; ChooseSort(arr); System.out.println(Arrays.toString(arr)); } public s.

package DataStructTest.csdn; import java.util.Arrays; public class 冒泡排序 { public static void main(String[] args) { int[] arr = {3, 5, 6, 7, 0}; BubbleSort(arr); } public static void BubbleSort(int[] arr) { int temp =.

package DataStructTest; public class StackTestDemo { public static void main(String[] args) { StackTestClass a = new StackTestClass(5); a.push(2); a.push(6); a.push(8); a.push(66); a.push(88); a.

package DataStructTest; public class 约瑟夫问题 { public static void main(String[] args) { CircleLinkedList c = new CircleLinkedList(); c.addBoy(5); c.showBoy(); c.countBoy(1, 2, 5);// 2 4 1 5 3 } } //循环链表 class Ci.

package DataStructTest; public class DoubleLinkedTest { public static void main(String[] args) { DoubleLinedListedOper a = new DoubleLinedListedOper(); DoubleLinkedNode node = new DoubleLinkedNode(22, "第一个结点"); DoubleLinkedNod.

//主要方法是reverseNode()方法 import java.util.Scanner; public class 单链表 { public static void main(String[] args) { Node a = new Node(1); Node a1 = new Node(88); Node a2 = new Node(66); Node a3 = new Node(68); Linked.

//主要方法是findLastIndexNode(int index) import java.util.Scanner; public class 单链表 { public static void main(String[] args) { Node a = new Node(1); Node a1 = new Node(88); Node a2 = new Node(66); Node a3 = new Node(68); .

//主要方法是getLength方法 import java.util.Scanner; public class 单链表 { public static void main(String[] args) { Node a = new Node(1); Node a1 = new Node(88); Node a2 = new Node(66); Node a3 = new Node(68); LinkedLis..

import java.util.Scanner; public class 数组队列 { public static void main(String[] args) { shuZu a = new shuZu(5); char key = ' '; Scanner sc = new Scanner(System.in); boolean loop = true; while (loop) { ..

import java.util.Scanner; public class 数组循环队列 { public static void main(String[] args) { xunhuanShuZu a = new xunhuanShuZu(8); char key = ' '; Scanner sc = new Scanner(System.in); boolean loop = true; while (l..

package DataStructTest.练习; import java.util.Scanner; public class 单链表 { public static void main(String[] args) { Node a = new Node(1); Node a1 = new Node(88); Node a2 = new Node(66); Node a3 = new Node(68); Li.