Liu每天学一点

public long quickPow(long base, long power) { long ans = 1; while (power > 0) { if (power % 2 == 1) { ans *= base; } power >>= 1; base *= base; } return ans;}

class LRUCache { //实现双向链表 class DLinkedNode { int key; int value; DLinkedNode pre; DLinkedNode next; public DLinkedNode(){} public DLinkedNode(int key, int value){ this.key = key;

class KMP { public int kmp(String text, String pattern) { int[] next = getNext(pattern); char[] t = text.toCharArray(), p = pattern.toCharArray(); int tlen = text.length(), plen = pattern.length();

public static void mergeSort(int[] arr, int l, int r) { if (r <= l) return; int m = (l + r) / 2; //分别对左右两组排序 mergeSort(arr, l, m); mergeSort(arr, m + 1, r); //合并 merge(arr, l, r);}static void merge(int[] arr, int l, int r) {

public static void BubbleSort(int[] arr, int l, int r) { for (int i = arr.length; i > 1; -- i) { for (int j = 1; j < i; ++ j) { if (arr[j - 1] > arr[j]) { int tmp = arr[j]; ...

public static void QuickSort(int[] arr, int l, int r) { if (r <= l) return; int pivot = partition(arr, l, r); QuickSort(arr, l, pivot - 1); QuickSort(arr, pivot + 1, r); } static int partition(int[] arr, int l,

字典树Trie Java实现TrieNode 实现/* Trie节点 */class TrieNode { private TrieNode[] links; // 记录下一个字母 private final int R = 26; private boolean isEnd; // 单词是否结束 public TrieNode() { links = new TrieNode[R]; } /* 查找字符 ch 是否为下一个字母 */ public boolean contai

并查集java实现class UnionFind{ private int count; // 集合计数 private int[] parents; // 记录根节点 private int[] size; // 记录集合中的节点数 /* 初始化，每个节点的根节点都是自身，共 n 个集合 */ public UnionFind(int n) { count = n; parents = new int[n]; size = new int[n]; for (int i = 0