![](https://img-blog.csdnimg.cn/20201014180756922.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
图
我,秦始皇的爷爷,打钱
道阻且长,行则将至
展开
-
LeetCode刷题记181-959. 由斜杠划分区域
LeetCode刷题记180959. 由斜杠划分区域题目class Solution { int[][] g; boolean[][] v1; // 左上区域。 / boolean[][] v2; // 右下区域。 / boolean[][] v3; // 左下区域。 \ boolean[][] v4; // 右上区域。 \ public void dfs(int i, int j, int n, int from) { // from=0,1,2原创 2021-01-25 16:46:47 · 72 阅读 · 0 评论 -
LeetCode刷题记180-1489. 找到最小生成树里的关键边和伪关键边
LeetCode刷题记1801489. 找到最小生成树里的关键边和伪关键边题目class Solution { public int minimumSpanningTree2(int n, int[][] g, int cur, int to, int dis) { int ans = dis; int _n = n; boolean[] v = new boolean[n]; int[] d = new int[n];原创 2021-01-21 23:15:27 · 89 阅读 · 0 评论 -
LeetCode刷题记179-1584. 连接所有点的最小费用
LeetCode刷题记1791584. 连接所有点的最小费用题目class Solution { public int minCostConnectPoints(int[][] points) { int ans = 0; int[] d = new int[points.length]; boolean[] v = new boolean[points.length]; Arrays.fill(d, Integer.MAX原创 2021-01-19 11:36:19 · 73 阅读 · 0 评论 -
LeetCode刷题记172-207. 课程表
LeetCode刷题记172207. 课程表题目class Solution { public boolean canFinish(int numCourses, int[][] prerequisites) { int[] inDeg = new int[numCourses]; List<Integer>[] afterCourses = new ArrayList[numCourses]; for (int i = 0; i原创 2021-01-13 11:25:33 · 67 阅读 · 0 评论 -
LeetCode刷题记168-1203. 项目管理
LeetCode刷题记1681203. 项目管理题目class Solution { public int[] sortItems(int n, int m, int[] group, List<List<Integer>> beforeItems) { int k = m; for (int i = 0; i < n; i ++) { if(group[i] == -1) group[i] = k ++;原创 2021-01-09 19:48:21 · 112 阅读 · 0 评论 -
LeetCode刷题记167-685. 冗余连接 II
LeetCode刷题记167685. 冗余连接 II题目class Solution { public boolean dfs(int st, boolean[][] g, int[] v, int k, int n, int[] fa) { v[st] = k; for (int i = 1; i <= n; i ++) { if (g[st][i]) { if (v[i] == 0) { /原创 2021-01-08 14:50:46 · 59 阅读 · 0 评论 -
LeetCode刷题记166-765. 情侣牵手
LeetCode刷题记166765. 情侣牵手题目class Solution { public int minSwapsCouples(int[] row) { int[] id = new int[row.length]; for (int i = 0; i < row.length; i ++) { id[row[i]] = i; } int ans = 0; for (int原创 2021-01-07 10:09:14 · 56 阅读 · 0 评论 -
LeetCode刷题记165-547. 省份数量
LeetCode刷题记165547. 省份数量题目class Solution { public void tintage(int fro, int[][] isConnected, int[] vis) { for (int i = 0; i < isConnected.length; i ++) { if (isConnected[fro][i] == 1 && vis[i] == 0) { v原创 2021-01-07 09:43:55 · 127 阅读 · 0 评论