javalj的博客

public static void main(String[] args) { String s = "ABCDABDEBBC ABCDAB ABCDABCDABDE"; String p = "ABCDABD"; System.out.println(match(s, p));}public static List<Integer> match(S...

滑动窗口 a = "abcabcbcbba"首先有一个字符串我们用hashset来作为滑动窗口set<Character> slide =new HashSet();用一个i表示窗口头，j表示窗口尾巴max来记录最长窗口 ij a = "a b c a b c b c b b a" int n = s.length(); Set<Character&gt...

解法1package tree.leveltraversal;import tree.Node;import tree.myavl.BalanceTree;import java.util.LinkedList;import java.util.Queue;/** * Created by lijie35 on 2020-01-21 10:45 AM . */public ...

package linkedlist;/** * Created by lijie35 on 2020-01-20 3:13 PM . */public class CombineList { public static void main(String[] args) { Node n1 = new Node(1); Node n3 = new ...

package tree.reverseTree;import tree.Node;import tree.myavl.BalanceTree;/** * Created by lijie35 on 2020-01-20 2:15 PM . */public class ReverseTree { public static void main(String[] args)...

解法1不知道什么原理。我写着写着就出来了，测试过也没有问题，有知道原理的可以告诉我package linkedlist;/** * Created by lijie35 on 2020-01-20 10:43 AM . */public class ListEntrance { public static void main(String[] args) {// ...

package linkedlist;/** * Created by lijie35 on 2020-01-20 10:43 AM . */public class ListEntrance { public static void main(String[] args) { Node h1 = new Node(0); Node h2 = ne...

package linkedlist;/** * Created by lijie35 on 2020-01-20 10:23 AM . */public class FastSlowPoint { public static void main(String[] args) { Node h1 = new Node(0); Node h2 = n...

递归写法，效率低package algorithm;/** * Created by lijie35 on 2020-01-19 3:21 PM . */public class Fibonacci { public static void main(String[] args) { System.out.println(fib(1)); } ...

package sort;/** * Created by lijie35 on 2020-01-19 1:55 PM . */public class BinarySearch { public static void main( String[] args) { int[] arr = {1, 2, 3, 5, 6, 7,13,15...

package linkedlist;/** * Created by lijie35 on 2020-01-17 5:04 PM . */public class ReverseNode { public static void main(String[] args) { System.out.println(); Node node = ne...

package sort;import java.util.Arrays;/** * Created by lijie35 on 2020-01-17 2:49 PM . */public class MergeSort { public static void main(String[] args) { // int arr[] = new int...

package sort;import java.util.Arrays;/** * Created by lijie35 on 2020-01-17 12:31 PM . */public class Quicksort { public static void main(String[] args) { //int[] arr = {3, 45, 7,6,...

package sort;import java.util.Arrays;public class BubblleSort { public static void main(String[] args) { int[] arr = {3, 45, 6, 8, 9, 2}; BubblleSort.sort(arr); } /**...

package sort;import java.util.Arrays;/** * Created by lijie35 on 2020-01-17 11:21 AM . */public class InsertionSort { public static void main(String[] args) { int [] arr={3,45,6,8,9...

就是最大堆的条件反过来package heap;import java.util.Arrays;public class SmallHeap { public static void main(String[] args) { SmallHeap smallHeap = new SmallHeap(); int[] a = new int[]{5,...

public class BigHeap2 { public static void main(String[] args) { BigHeap2 bigHeap2 = new BigHeap2(); int[] a = new int[]{5, 4, 3, 2, 1, 10, 20, 41, 15}; bigHeap2.sort(a);...

package heap;import java.util.Arrays;public class SmallHeap { public static void main(String[] args) { SmallHeap smallHeap=new SmallHeap(); int[] a=new int[]{5,4,3,2,1,10,20,41...

package heap;import java.util.Arrays;/** * Created by lijie35 on 2020-01-16 3:49 PM . */public class BigHeap { public static void main(String[] args) { int[] arr = {3, 4, 23, ...

``javapackage tree.myavl;import tree.Node;/**Created by lijie35 on 2020-01-15 6:37 PM .*/public class BalanceTree {private static final int LEFT = 0 ;private static final int RIGHT = 1 ;Nod...

算法冒泡排序package argorithm;import java.util.Arrays;public class Bubble { public static void main(String[] args) { int[] xx=new int[]{10,2,3,44,32,34,24,65,787,23}; Bubble.bubble...