diff options
author | Jack Sangdahl <[email protected]> | 2025-03-10 00:36:13 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-03-10 00:36:13 -0600 |
commit | 7c60dee83b436e8e8a667bf9f191beced8de4fc3 (patch) | |
tree | eb7a24ee2067f92245c57bb118e85a1baf15df50 /other/clone_graph.cpp | |
parent | 5d7cdc215e4ba1ec4cbb24c084cccb5e5e641468 (diff) | |
download | leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.tar.gz leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.zip |
chore: move cpp and rust code to directory
Diffstat (limited to 'other/clone_graph.cpp')
-rw-r--r-- | other/clone_graph.cpp | 55 |
1 files changed, 55 insertions, 0 deletions
diff --git a/other/clone_graph.cpp b/other/clone_graph.cpp new file mode 100644 index 0000000..fc372a0 --- /dev/null +++ b/other/clone_graph.cpp @@ -0,0 +1,55 @@ +// 133. Clone Graph +#include <cstddef> +#include <unordered_map> +#include <vector> +using namespace std; + +// given 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 and a +// list (list[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 { + Node *dfs(Node *curr, unordered_map<Node *, Node *> &um) { + vector<Node *> neighbour; + Node *clone = new Node(curr->val); + um[curr] = clone; + for (auto i : curr->neighbors) { + if (um.find(i) != um.end()) + neighbour.push_back(um[i]); + else + neighbour.push_back(dfs(i, um)); + } + clone->neighbors = neighbour; + return clone; + } + +public: + Node *cloneGraph(Node *node) { + unordered_map<Node *, Node *> um; + if (node == NULL) + return NULL; + if (!node->neighbors.size()) { + Node *clone = new Node(node->val); + return clone; + } + return dfs(node, um); + } +}; |