![](https://img-blog.csdnimg.cn/20201014180756916.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
数据结构与算法
javalj_hz
一个
展开
-
kmp算法
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...原创 2020-04-02 20:07:55 · 145 阅读 · 0 评论 -
滑动窗口计算最长不重复串
滑动窗口 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>...原创 2020-02-24 16:06:44 · 218 阅读 · 0 评论 -
按层次遍历树结构
解法1 package 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 ...原创 2020-01-21 14:42:07 · 291 阅读 · 0 评论 -
合并链表
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 ...原创 2020-01-20 15:50:28 · 99 阅读 · 0 评论 -
翻转树
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)...原创 2020-01-20 15:00:25 · 232 阅读 · 0 评论 -
链表入口解法1
解法1 不知道什么原理。我写着写着就出来了,测试过也没有问题,有知道原理的可以告诉我 package linkedlist; /** * Created by lijie35 on 2020-01-20 10:43 AM . */ public class ListEntrance { public static void main(String[] args) { // ...原创 2020-01-20 14:13:03 · 85 阅读 · 0 评论 -
链表找环的入口
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...原创 2020-01-20 11:35:08 · 143 阅读 · 0 评论 -
快慢指针判断链表成环的问题
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...原创 2020-01-20 10:41:21 · 280 阅读 · 0 评论 -
斐波那契数列解法
递归写法,效率低 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)); } ...原创 2020-01-19 15:53:07 · 139 阅读 · 0 评论 -
二分查找
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...原创 2020-01-19 14:31:45 · 70 阅读 · 0 评论 -
翻转连表
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...原创 2020-01-19 13:03:43 · 147 阅读 · 0 评论 -
归并排序
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...原创 2020-01-17 16:37:42 · 54 阅读 · 0 评论 -
快排算法
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,...原创 2020-01-17 14:43:46 · 90 阅读 · 0 评论 -
冒泡排序
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); } /** ...原创 2020-01-17 11:59:07 · 161 阅读 · 0 评论 -
插入排序
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...原创 2020-01-17 11:45:47 · 59 阅读 · 0 评论 -
最小堆
就是最大堆的条件反过来 package heap; import java.util.Arrays; public class SmallHeap { public static void main(String[] args) { SmallHeap smallHeap = new SmallHeap(); int[] a = new int[]{5,...原创 2020-01-17 10:35:52 · 69 阅读 · 0 评论 -
大堆顶实现
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);...原创 2020-01-17 10:27:50 · 180 阅读 · 0 评论 -
最小堆排序
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...原创 2020-01-16 19:17:06 · 87 阅读 · 0 评论 -
大堆顶排序
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, ...原创 2020-01-16 18:56:01 · 159 阅读 · 0 评论 -
平衡二叉树的实现
``java package 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...原创 2020-01-16 13:58:49 · 104 阅读 · 0 评论 -
简单算法
算法 冒泡排序 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...原创 2019-09-16 18:57:23 · 74 阅读 · 0 评论