261. Graph Valid Tree

Description

Given n nodes labeled from 0 to n-1 and a list of undirected edges (each edge is a pair of nodes), write a function to check whether these edges make up a valid tree.

Example 1:

Input: n = 5, and edges = [[0,1], [0,2], [0,3], [1,4]]
Output: true
Example 2:

Input: n = 5, and edges = [[0,1], [1,2], [2,3], [1,3], [1,4]]
Output: false
Note: you can assume that no duplicate edges will appear in edges. Since all edges are undirected, [0,1] is the same as [1,0] and thus will not appear together in edges.

Problem URL

---

Solution

给n个点和一个edges数组，表示连接两个点的边，判断这个图是不是一棵树。

Construct a array denotes node’s next value, use union-search for each edges. If the result is same, it means the graph is broke or have circle, return false

And the number of edges should be n - 1.

Code

class Solution {
    public boolean validTree(int n, int[][] edges) {
        //new a int[]. index i denotes ith node have a edge to nodes[i];
        int[] nodes = new int[n];
        //Initially, all nodes are seperate from each other.
        Arrays.fill(nodes, -1);
        
        for (int i = 0; i < edges.length; i++){
            int x = find(nodes, edges[i][0]);
            int y = find(nodes, edges[i][1]);
            
            if (x == y){
                return false;
            }
            
            nodes[x] = y;
        }
        //If it is a valid tree, e = n - 1;
        return edges.length == n - 1;
    }
    
    private int find(int[] nodes, int i){
        if (nodes[i] == -1){
            return i;
        }
        return find(nodes, nodes[i]);
    }
}

Time Complexity: O(n * e)
Space Complexity: O(n)

---

Review