133. Clone Graph
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 ne
ighbors.
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. Fo
r 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 adj
acency 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 c
opy of the given node as a reference to the cloned graph.
吐了
想說怎麼可能連case 2都過不了
結果發現這一題它給的點只要被改到
就不給過
媽的
第一次遇到這種事
把我的時間還我