anhooo的博客

public class TreeNode{ int val; TreeNode left; TreeNode right; TreeNode(int val){ this.val = val; }}一、二叉树的前序遍历//非递归实现public void preOrder(TreeNode root){ if(root == null) return; Stack<TreeNode> stack = n.

注意：最小TopK用大顶堆，最大TopK用小顶堆一、用java 的priorityQueue实现//最小Top， 用java的PriorityQueueimport java.util.*;public class Solution{ public ArrayList<Integer<> getLeastNumber_Solution(int[] input, int k){ int n = input.length; ArrayLis

LRU 缓存的两种实现方式一、使用LinkedHashMap实现class LRUCache { Map<Integer, Integer> cache=null; public LRUCache(int capacity) { cache = new LinkedHashMap<>(capacity, 0.75f, true){ @Override public boolean remov