若砚的博客

思路深度优先搜索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

思路1深度优先搜索 public int findCircleNum1(int[][] isConnected) { int provinces = isConnected.length; boolean[] visited = new boolean[provinces]; int circles = 0; for (int i = 0; i < provinces; i++) { if (!visit