LeetCode 685. Redundant Connection II
原题链接在这里:https://leetcode.com/problems/redundant-connection-ii/ 题目: In this problem,a rooted tree is a?directed?graph such that,there is exactly one node (the root) for which all other nodes are descendants of this node,plus every node has exactly one parent,except for the root node which has no parents. The given input is a directed graph that started as a rooted tree with N nodes (with distinct values 1,2,...,N),with one additional directed edge added. The added edge has two different vertices chosen from 1 to N,and was not an edge that already existed. The resulting graph is given as a 2D-array of? Return an edge that can be removed so that the resulting graph is a rooted tree of N nodes. If there are multiple answers,return the answer that occurs last in the given 2D-array. Example 1: Input: [[1,2],[1,3],[2,3]] Output: [2,3] Explanation: The given directed graph will be like this: 1 / v v 2-->3 Example 2: Input: [[1,[3,4],[4,1],5]] Output: [4,1] Explanation: The given directed graph will be like this: 5 <- 1 -> 2 ^ | | v 4 <- 3 Note:
题解: If it is a invalid tree,there could be 2 cases:
If remove one redundant edge could make it a valid tree. If case 1 happens,then redundant edge must be either [i,j] or [k,j]. Otherwise,even you remove the redundant edge,[i,j] and [k,j] still point to the same node j and it is still invalid. Thus make them candidate 1 and candidate 2. We check if cycle exists,if it exists,we check if case 1 happens or not. If no,then edge contecting 2 nodes already within the same union is the redundant edge likeRedundant Connection. If yes,redundant edge is either candiate 1 or 2. First remove candidate 2 and check if cycle still exists,if no then answer is candidate 2,otherwise it is candidate 1. Time Complexity: O(nlogn). find takes O(n). Space: O(n). AC Java: 1 class Solution { 2 int [] parent; 3 4 public int[] findRedundantDirectedConnection(int[][] edges) { 5 int n = edges.length; 6 parent = new int[n+1]; 7 8 int [] can1 = new int[]{-1,-1}; 9 int [] can2 = new int[]{-1,-1}; 10 for(int i = 0; i<n; i++){ 11 if(parent[edges[i][1]] == 0){ 12 parent[edges[i][1]] = edges[i][0]; 13 }else{ 14 can2 = new int[]{edges[i][0],edges[i][1]}; 15 can1 = new int[]{parent[edges[i][1]],edges[i][1]}; 16 edges[i][1] = 0; 17 } 18 } 19 20 for(int i = 0; i<=n; i++){ 21 parent[i] = i; 22 } 23 24 for(int [] edge : edges){ 25 if(find(edge[0]) == find(edge[1])){ 26 if(can1[0] == -1){ 27 return edge; 28 } 29 30 return can1; 31 } 32 33 union(edge[0],edge[1]); 34 } 35 36 return can2; 37 } 38 39 private int find(int i){ 40 if(i != parent[i]){ 41 parent[i] = find(parent[i]); 42 } 43 44 return parent[i]; 45 } 46 47 private void union(int i,int j){ 48 int p = find(i); 49 int q = find(j); 50 parent[q] = p; 51 } 52 } 类似Redundant Connection. (编辑:李大同) 【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容! |
- linux – 不能SUDO SU了,“没有tty存在且没有指定askpass程
- 如何识别从Linux机箱连接到同一交换机的NIC?
- linux – 如何从bash中的文本文件中读取第n行?
- linux – 使用du -sh *命令时如何根据子目录的大小进行排序
- linux – 主DNS服务器失败的DNS / resolv.conf设置?
- linux – git-daemon:“无法在主机(null)端口9418上分配任
- linux – 使用fail2ban的最大bantime
- Zynq 7000上的嵌入式Linux,几乎丢弃了所有UDP数据包
- linux – 用cat读取:不接收数据时停止
- Vmware中linux端口映射,让外网/ssh访问虚拟机Linux