[lintCode] 178. Graph Valid Tree

描述

https://www.lintcode.com/problem/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.

• 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.

Example
Given n = 5 and edges = [[0, 1], [0, 2], [0, 3], [1, 4]], return true.

Given n = 5 and edges = [[0, 1], [1, 2], [2, 3], [1, 3], [1, 4]], return false.

解题思路

先建立一张表，然后BFS，只是有些小trick

代码

public class Solution {
    /**
     * @param n: An integer
     * @param edges: a list of undirected edges
     * @return: true if it's a valid tree, or false
     */
    public boolean validTree(int n, int[][] edges) {
        if(edges.length != n-1){
            return false;
        }

        //build graph
        Map<Integer, List<Integer>> neighbors = new HashMap<>();
        for(int i=0;i<n;++i){
            neighbors.put(i, new ArrayList<Integer>());
        }
        for(int[] edge : edges){
            int a = edge[0];
            int b = edge[1];
            neighbors.get(a).add(b);
            neighbors.get(b).add(a);
        }
        //build finish

        return validTree(n, neighbors, 0);
    }

    boolean validTree(final int n, Map<Integer, List<Integer>> neighbors, int root){
        Integer[] parent = new Integer[n];
        Queue<Integer> queue = new LinkedList<>();

        queue.offer(root);
        parent[root] = root;
        while(!queue.isEmpty()){
            int now = queue.poll();
            List<Integer> childs = neighbors.get(now);

            for(Integer child: childs){
                if(parent[now].equals(child)){// meet parent node
                    continue;
                }else if(null == parent[child]){
                    queue.offer(child);
                    parent[child] = now;
                }else{
                    return false;// there has a loop
                }
            }
        }

        for(int i=0;i<n;++i){
            if(parent[i] == null){
                return false;// root is non't connected to i
            }
        }

        return true;
    }
}