憨憨李四的博客

public class 二维数组转稀疏数组 { public static void main(String[] args) { //创建一个原始的二维数组--棋盘 //0:表示没有棋子,1表示 黑子,2表示 篮子 int chessArr1[][] = new int[11][11]; chessArr1[1][2] = 1; chessArr1[2][3] = 2; //输出原始的二维数组

import java.util.Scanner;/** * @author lijia * @version 1.0 */public class ArrayQueueTest { public static void main(String[] args) { //创建一个队列 ArrayQueue queue = new ArrayQueue(6); char value = ' '; //接受用户输入 Scann

import java.util.Scanner;/** * @author lijia * @version 1.0 */public class ArrayStackTest { public static void main(String[] args) { //测试ArrayStack ArrayStack stack = new ArrayStack(4); String key = ""; boolean loo

public class SingleLinkedListTest { public static void main(String[] args) { //先创建几个节点 HeroNode hero1 = new HeroNode(1, "宋江", "及时雨"); HeroNode hero2 = new HeroNode(2, "卢俊义", "玉麒麟"); HeroNode hero3 = new HeroNode(3, "吴用",

public class DoubleLinkedListTest { public static void main(String[] args) { //先创建几个节点 Node hero1 = new Node(1, "宋江", "及时雨"); Node hero2 = new Node(2, "卢俊义", "玉麒麟"); Node hero3 = new Node(3, "吴用", "智多星"); Node he

public class CircleSingleLinkedList { //创建第一个first节点,当前无编号 private Node first = null; //添加小孩节点,构成一个环形链表 public void addBoy(int nums) { //判断nums是否是负数 if (nums < 1) { System.out.println("输入值不正确!");

打印问题:public class Print { public static void main(String[] args) { test(4); System.out.println(); test1(4); } //静态方法 public static void test(int value) { if (value > 2) { test(value - 1);

public class Fibonacci { public static void main(String[] args) { //打印出斐波纳契数列前40个数字 for (int i = 1; i <= 40; i++) { System.out.println(calc(i)+" "); } } //算法 - 斐波纳契数列 public static int calc(int n) {

public class Hanoitower { //私有计数变量 static int count = 0; public static void main(String[] args) { //测试汉诺塔 hanoiTower(3, 'A', 'B', 'C'); System.out.println("步数: " + count); } public static void hanoiTower(int num, char a, char b, char c) { c

public class MiGong { public static void main(String[] args) { //初始化迷宫 int[][] map = new int[8][7]; //用1表示墙 //上下为1 for (int i = 0; i < 7; i++) { map[0][i] = 1; map[7][i] = 1; }

public class Queen8 { //定义有多少个皇后 int size = 8; //定义数组array,保存皇后的位置,比如 arr = {0,4,7,5,2,6,1,3} int[] array = new int[size]; //统计有多少种解法 static int count = 0; //统计判断冲突的次数 static int judgeCount = 0; public static void mai