若砚的博客

思路深度优先搜索LeetCode没有全部AC，卡在了第53个测试用例，原因是超时。 public static List<Integer> findMinHeightTrees(int n, int[][] edges) { int[][] tree = graph(n, edges); Map<Integer, List<Integer>> deepList = new HashMap<Integer, List<Integer&g

迭代 public static List<Integer> inorderTraversal(TreeNode root) { List<Integer> list = new ArrayList<Integer>(); Deque<TreeNode> stk = new LinkedList<TreeNode>(); TreeNode t = root; stk.push(new TreeNode());