diff options
author | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
commit | a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch) | |
tree | e2a2b3f49f9fb741be81415266ac93e74cff42ec /other/clone_graph.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/clone_graph.cpp')
-rw-r--r-- | other/clone_graph.cpp | 55 |
1 files changed, 0 insertions, 55 deletions
diff --git a/other/clone_graph.cpp b/other/clone_graph.cpp deleted file mode 100644 index fc372a0..0000000 --- a/other/clone_graph.cpp +++ /dev/null @@ -1,55 +0,0 @@ -// 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); - } -}; |