每天都要加油鸭

/** * @author lixin * @date 2019/3/14 - 21:21 */public class Testhanoi { public static void main(String[] args) { hanoi(3, 'A', 'B', 'C'); } /** * @param n 一共有N个盘子 ...

/** * @author lixin * @date 2019/3/23 - 17:32 */import java.util.Arrays;public class HeapSort { public static void main(String[] args) { int[] arr = new int[]{9, 6, 8, 7, 0, 1, 10,...

/**** 顺序存储的二叉树通常情况只考虑完全二叉树* 第n个元素的左子节点是：2*n+1* 第n个元素的右子节点是：2*n+2* 第n个元素的父节点是：(n-1)/2***/public class ArrayBinaryTree{ int[] data; public ArrayBinaryTree(int[] data){ this.data = data;...

问题 1461: [蓝桥杯][基础练习VIP]FJ的字符串时间限制: 1Sec 内存限制: 128MB 提交: 905 解决: 553题目描述FJ在沙盘上写了这样一些字符串： A1 = “A” A2 = “ABA” A3 = “ABACABA” A4 = “ABACABADABACABA” … … 你能找出其中的规律并写所有的数列AN吗？输入仅...

import java.util.Arrays;/** * @author lixin * @date 2019/3/17 - 11:42 */public class MergeSort { public static void main(String[] args) { int[] arr = new int[]{1, 3, 4, 5, 2, 7, 6, ...

/** * @author lixin * @date 2019/3/20 - 20:52 */public class BinaryTree { Node root; //设置根节点 public void setRoot(Node root) { this.root = root; } //获取根节点 public...

import java.util.Scanner;/** * 暴力破解法 可继续优化 */public class Main1 { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); int sum = 0; whil...

import java.util.Arrays;/** * @author lixin * @date 2019/3/16 - 12:07 */public class SelectSort { public static void main(String[] args) { int[] arr = new int[]{1, 3, 4, 5, 2, 7, 6, ...

import java.util.Arrays;/** * @author lixin * @date 2019/3/16 - 11:34 */public class ShellSort { public static void main(String[] args) { int[] arr = new int[]{1, 3, 4, 5, 2, 7, 6, ...

import java.util.Arrays;/** * @author lixin * @date 2019/3/16 - 10:52 */public class InsertSort { public static void main(String[] args) { int[] arr = new int[]{1, 3, 4, 5, 2, 7, 6, ...

import java.util.Arrays;/** * @author lixin * @date 2019/3/15 - 21:14 */public class QuickSort { public static void main(String[] args) { int[] arr = new int[]{1, 3, 4, 5, 2, 7, 6, 4...

import java.util.Arrays;/** * @author lixin * @date 2019/3/15 - 20:45 */public class BubbleSort { public static void main(String[] args) { int[] arr = new int[]{1, 3, 4, 5, 2, 2, 3,...

/** * @author lixin * @date 2019/3/19 - 19:52 */import java.util.Arrays;public class RadixSort { public static void main(String[] args) { int[] arr = new int[]{23, 6, 189, 45, 9, 2...

public class Node implements Comparable<Node> { int value; Node left; Node right; public Node(int value) { this.value = value; } @Override public int compareTo(Node o) { return -(th...