#133 Clone Graph

Description

Given a reference of a node in a connected undirected graph.

Return a deep copy (clone) of the graph.

Each node in the graph contains a value (int) and a list (List[Node]) of its neighbors.

class Node {
    public int val;
    public List<Node> neighbors;
}

Test case format:
For simplicity, each node’s value is the same as the node’s index (1-indexed). For example, the first node with val == 1, the second node with val == 2, and so on. The graph is represented in the test case using an adjacency list.

An adjacency list is a collection of unordered lists used to represent a finite graph. Each list describes the set of neighbors of a node in the graph.

The given node will always be the first node with val = 1. You must return the copy of the given node as a reference to the cloned graph.

Examples

Example 1:

Input: adjList = [[2,4],[1,3],[2,4],[1,3]]
Output: [[2,4],[1,3],[2,4],[1,3]]
Explanation: There are 4 nodes in the graph.
1st node (val = 1)'s neighbors are 2nd node (val = 2) and 4th node (val = 4).
2nd node (val = 2)'s neighbors are 1st node (val = 1) and 3rd node (val = 3).
3rd node (val = 3)'s neighbors are 2nd node (val = 2) and 4th node (val = 4).
4th node (val = 4)'s neighbors are 1st node (val = 1) and 3rd node (val = 3).

Example 2:

Input: adjList = [[]]
Output: [[]]
Explanation: Note that the input contains one empty list. The graph consists of only one node with val = 1 and it does not have any neighbors.

Example 3:

Input: adjList = []
Output: []
Explanation: This an empty graph, it does not have any nodes.

Example 4:

Input: adjList = [[2],[1]]
Output: [[2],[1]]

思路

这个代码其实就是遍历图，没什么好说的……
用dfs和bfs都可以，关键是在于判断哪些点已经被“遍历”过了（这些点就不需要进一步操作了）。

我自己是写了bfs，dfs用了submission里面的代码

代码

bfs

/*
// Definition for a Node.
class Node {
    public int val;
    public List<Node> neighbors;
    public Node() {
        val = 0;
        neighbors = new ArrayList<Node>();
    }
    public Node(int _val) {
        val = _val;
        neighbors = new ArrayList<Node>();
    }
    public Node(int _val, ArrayList<Node> _neighbors) {
        val = _val;
        neighbors = _neighbors;
    }
}
*/

class Solution {
    public Node cloneGraph(Node node) {
        if (node == null)
            return null;
        Node[] copyNodes = new Node[101];
        boolean[] copied = new boolean[101];
        
        for(int i = 1; i <= 100; i++){
            copyNodes[i] = new Node(i);
            copied[i] = false;
        }
        
        
        List<Node> query = new ArrayList<>();
        query.add(node);
        
        while(query.size() != 0){
            Node currNode = query.get(0);
            int currNodeVal = currNode.val;
            if(copied[currNodeVal]){
                query.remove(0);
                continue;
            }
            
            List<Node> neighbors = currNode.neighbors;
            
            for(Node neighbor: neighbors){
                query.add(neighbor);
                copyNodes[currNodeVal].neighbors.add(copyNodes[neighbor.val]);
            }
            copied[currNodeVal] = true;
            query.remove(0);
        }
        
        return copyNodes[1];
    }
}

dfs

class Solution {
    Map<Node,Node> map = new HashMap<>();
    public Node cloneGraph(Node node) {
        if(node == null){
            return null;
        }
        if(map.containsKey(node)){
            return map.get(node);
        }
        Node newNode = new Node(node.val,new ArrayList<>());
        map.put(node,newNode);
        for(Node child:node.neighbors){
            newNode.neighbors.add(cloneGraph(child));
        }
        return newNode;
    }
}