AlgorithmJourney/LeetCode/LeetCode133.java at main · HenryJi529/AlgorithmJourney · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
import java.util.Arrays;
import java.util.HashMap;

import util.Node;
import util.PrintUtil;
import util.GraphTool;

public class LeetCode133 {
    public static void main(String[] args) {
        Node[] nodes1, nodes2;
        int[][] adjList;
        // 输入：adjList = [[2,4],[1,3],[2,4],[1,3]]
        // 输出：[[2,4],[1,3],[2,4],[1,3]]
        adjList = new int[][] { { 2, 4 }, { 1, 3 }, { 2, 4 }, { 1, 3 } };
        System.out.println(Arrays.deepToString(adjList));
        nodes1 = GraphTool.getNodesFromAdjList(adjList);
        nodes2 = GraphTool.getNodesFromFirstNode(new Solution133().cloneGraph(nodes1[0]));
        System.out.println(Arrays.toString(nodes2));
        System.out.println(Arrays.deepToString(GraphTool
                .getAdjListFromNodes(nodes2)));
        PrintUtil.printDivider();

        // 输入：adjList = [[]]
        // 输出：[[]]
        adjList = new int[][] { {} };
        System.out.println(Arrays.deepToString(adjList));
        nodes1 = GraphTool.getNodesFromAdjList(adjList);
        nodes2 = GraphTool.getNodesFromFirstNode(new Solution133().cloneGraph(nodes1[0]));
        System.out.println(Arrays.toString(nodes2));
        System.out.println(Arrays.deepToString(GraphTool
                .getAdjListFromNodes(nodes2)));
        PrintUtil.printDivider();

        // 输入：adjList = []
        // 输出：[]
        adjList = new int[][] {};
        System.out.println(Arrays.deepToString(adjList));
        nodes1 = GraphTool.getNodesFromAdjList(adjList);
        nodes2 = GraphTool.getNodesFromFirstNode(new Solution133().cloneGraph(null));
        System.out.println(Arrays.toString(nodes2));
        System.out.println(Arrays.deepToString(GraphTool
                .getAdjListFromNodes(nodes2)));
        PrintUtil.printDivider();

        // 输入：adjList = [[2],[1]]
        // 输出：[[2],[1]]
        adjList = new int[][] { { 2 }, { 1 } };
        System.out.println(Arrays.deepToString(adjList));
        nodes1 = GraphTool.getNodesFromAdjList(adjList);
        nodes2 = GraphTool.getNodesFromFirstNode(new Solution133().cloneGraph(nodes1[0]));
        System.out.println(Arrays.toString(nodes2));
        System.out.println(Arrays.deepToString(GraphTool
                .getAdjListFromNodes(nodes2)));
        PrintUtil.printDivider();
    }
}

class Solution133 {
    HashMap<Integer, Node> map = new HashMap<Integer, Node>();

    public Node cloneGraph(Node node) {
        if (node == null) {
            return null;
        }
        if (map.containsKey(node.val)) {
            return map.get(node.val);
        }

        Node newNode = new Node(node.val);
        map.put(node.val, newNode);
        for (Node neighbor : node.neighbors) {
            newNode.neighbors.add(cloneGraph(neighbor));
        }
        return newNode;
    }
}