问题描述:
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 val (int
) and a list (List[Node]
) of its neighbors.
class Node {
public int val;
public List<Node> neighbors;
}
Test case format:
For simplicity sake, 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.
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.
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递归。记得用一个map记录遍历过的位置。时间86%,空间100%。
/*
// Definition for a Node.
class Node {
public:
int val;
vector<Node*> neighbors;
Node() {
val = 0;
neighbors = vector<Node*>();
}
Node(int _val) {
val = _val;
neighbors = vector<Node*>();
}
Node(int _val, vector<Node*> _neighbors) {
val = _val;
neighbors = _neighbors;
}
};
*/
class Solution {
public:
unordered_map<int, Node*> visit;
Node* help(Node* node){
if(!node) return NULL;
if(visit.count(node->val)) return visit[node->val];
Node* newNode = new Node(node->val);
visit[node->val] = newNode;
for(auto item: node->neighbors){
// cout<<node->val<<" "<<item->val<<endl;
newNode->neighbors.push_back(help(item));
}
return newNode;
}
Node* cloneGraph(Node* node) {
return help(node);
}
};
非递归的DFS:时间98%。空间100%
/*
// Definition for a Node.
class Node {
public:
int val;
vector<Node*> neighbors;
Node() {
val = 0;
neighbors = vector<Node*>();
}
Node(int _val) {
val = _val;
neighbors = vector<Node*>();
}
Node(int _val, vector<Node*> _neighbors) {
val = _val;
neighbors = _neighbors;
}
};
*/
class Solution {
public:
Node* cloneGraph(Node* node) {
Node* result = NULL;
if(!node) return result;
result = new Node(node->val);
unordered_map<Node*, Node*> visit;
visit[node] = result;
stack<Node*> st;
st.push(node);
while(!st.empty()){
Node* tmp = st.top();
st.pop();
for(auto item: tmp->neighbors){
if(!visit.count(item)){
st.push(item);
Node* newNode = new Node(item->val);
visit[item] = newNode;
}
visit[tmp]->neighbors.push_back(visit[item]);
}
}
return result;
}
};
非递归的BFS:
/*
// Definition for a Node.
class Node {
public:
int val;
vector<Node*> neighbors;
Node() {
val = 0;
neighbors = vector<Node*>();
}
Node(int _val) {
val = _val;
neighbors = vector<Node*>();
}
Node(int _val, vector<Node*> _neighbors) {
val = _val;
neighbors = _neighbors;
}
};
*/
class Solution {
public:
Node* cloneGraph(Node* node) {
Node* result = NULL;
if(!node) return result;
result = new Node(node->val);
unordered_map<Node*, Node*> visit;
visit[node] = result;
queue<Node*> st;
st.push(node);
while(!st.empty()){
Node* tmp = st.front();
st.pop();
for(auto item: tmp->neighbors){
if(!visit.count(item)){
st.push(item);
Node* newNode = new Node(item->val);
visit[item] = newNode;
}
visit[tmp]->neighbors.push_back(visit[item]);
}
}
return result;
}
};