Commit 83dec21

author

scuyjzh

committed

modify solutions to problem - "133. Clone Graph"

1 parent b90943b commit 83dec21Copy full SHA for 83dec21

File tree

-4

lines changed

-4

lines changed

Lines changed: 4 additions & 4 deletions

Original file line number	Diff line number	Diff line change
`@@ -55,7 +55,7 @@ private Node dfs(Node node, HashMap<Node, Node> visited) {`
`55`	`55`	`}`
`56`	`56`
`57`	`57`	`// 克隆节点,注意到为了深拷贝,不会克隆它的邻居的列表`
`58`		`- Node cloneNode = new Node(node.val, new ArrayList());`
	`58`	`+ Node cloneNode = new Node(node.val, new ArrayList<>());`
`59`	`59`	`// 哈希表存储`
`60`	`60`	`visited.put(node, cloneNode);`
`61`	`61`
`@@ -74,13 +74,13 @@ public Node cloneGraph2(Node node) {`
`74`	`74`	`return node;`
`75`	`75`	`}`
`76`	`76`
`77`		`- HashMap<Node, Node> visited = new HashMap();`
	`77`	`+ HashMap<Node, Node> visited = new HashMap<>();`
`78`	`78`
`79`	`79`	`// 将题目给定的节点添加到队列`
`80`	`80`	`Deque<Node> queue = new ArrayDeque<>();`
`81`	`81`	`queue.offer(node);`
`82`	`82`	`// 克隆第一个节点并存储到哈希表中`
`83`		`- visited.put(node, new Node(node.val, new ArrayList()));`
	`83`	`+ visited.put(node, new Node(node.val, new ArrayList<>()));`
`84`	`84`
`85`	`85`	`// 广度优先搜索`
`86`	`86`	`while (!queue.isEmpty()) {`
`@@ -90,7 +90,7 @@ public Node cloneGraph2(Node node) {`
`90`	`90`	`for (Node neighbor : curNode.neighbors) {`
`91`	`91`	`if (!visited.containsKey(neighbor)) {`
`92`	`92`	`// 如果没有被访问过,就克隆并存储在哈希表中`
`93`		`- visited.put(neighbor, new Node(neighbor.val, new ArrayList()));`
	`93`	`+ visited.put(neighbor, new Node(neighbor.val, new ArrayList<>()));`
`94`	`94`	`// 将邻居节点加入队列中`
`95`	`95`	`queue.offer(neighbor);`
`96`	`96`	`}`

Comments

(0)