qq_48974601的博客

原创 search String查找字符串

package jdbc;import java.io.File;import java.io.FileNotFoundException;import java.io.FileReader;import java.io.IOException;public class SearchString { private static int mount = 0; public static void main(String[] args) { Strin

原创 HashMap 实现

package com.jt.test;import java.util.HashMap;public class MyHashMap { public Node[] HeadNode = new Node[11]; public int size = 0; public float loadFactor = 0.75f; public class Node { Node next; Object key; Obje

原创 radixSort 基数排序＜桶排序＞

package sort;import java.util.Arrays;public class RadixSort { public static void main(String[] args) { int[] a = {5,4,3,2,1,9,8,96,75}; a = sort(a, 9, 2, 10); System.out.println(Arrays.toString(a)); } public static int[] sort(int[] a, int

原创 architectureDesign A段B段-架构设计思维图

原创 springBoot-start dynamic springBoot启动分析简图

原创 BinaryTree二叉树

一 algorithm算法在这里插入代码片package MyBinaryTree;public class MyBinaryTree<T extends Comparable> { private Node root; private int count; private Object[] arrayData; private int index; public void add(Comparable<T> data) { if(null == da

原创 BinaryInsert二分插入排序

package com.jt.pojo;import java.util.Arrays;public class BinaryInsert { public static void main(String[] args) { int[] a = {1,3,5,7,2}; sort(a); System.out.println(Arrays.toString(a)); } public static void sort(int

原创 ChooseSort选择排序

package com.jt.pojo;import java.util.Arrays;public class ChooseSort { public static void main(String[] args) { int[] a = {5, 4, 3, 2, 1}; sort(a); System.out.println(Arrays.toString(a)); } public static void sort(in

原创 HeapSort堆排序

import java.util.Arrays;public class HeapSort { public static void main(String[] args) { int[] a = {9, 4, 5, 2, 1, 6}; for(int i = 0; i < a.length; i ++) { System.out.println(a[i] + ","); } System.out.p

原创 insertSort插入排序

import java.util.Arrays;import org.junit.Test;public class insertSort { public static void main(String[] args) { int[] a = {5, 4, 3, 2, 1}; sort(a); System.out.println(Arrays.toString(a)); } @Test public static int[] sort(int[] a) { for(int

原创 MergeSort合并＜归并＞排序

package com.jt.pojo;import java.util.Arrays;public class MergeSort { public static void main(String[] args) { int[] a = {5, 4, 3, 2, 1}; mergesort(a, 0, a.length -1); System.out.println(Arrays.toString(a)); } public

原创 QuickSort快速排序

package com.jt.pojo;import java.util.Arrays;public class QuickSort { public static void main(String[] args) { int[] a = {1,3,2,5,7,45,86,97,64}; sort(a, 0, a.length -1); System.out.println(Arrays.toString(a)); } pub

原创 ShellSort希尔排序

package com.jt.pojo;import java.util.Arrays;public class ShellSort { public static void main(String[] args) { int[] a = {5, 4, 3, 2, 1}; sort(a); System.out.println(Arrays.toString(a)); } public static void sort(int

原创 DubbleSort冒泡排序

package com.jt.pojo;import java.util.Arrays;public class DubbleSort { public static void main(String[] args) { int[] a = {5,4,3,2,1}; sort(a); System.out.println(Arrays.toString(a)); } public static int[] sort(int[]

原创 algorithm-dataStructure算法-数据结构图

原创 design patterns23种设计模式简图

原创 distributed-cluster分布式集群架构图

原创 AOP origin-application原理图-应用

原创 client-server SSM-MVC 三层架构图(逻辑+实体+AOP)

原创 JVM origin 原理图