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/find_path_graph.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/find_path_graph.cpp')
-rw-r--r-- | other/find_path_graph.cpp | 28 |
1 files changed, 0 insertions, 28 deletions
diff --git a/other/find_path_graph.cpp b/other/find_path_graph.cpp deleted file mode 100644 index 9f6c8ae..0000000 --- a/other/find_path_graph.cpp +++ /dev/null @@ -1,28 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - bool validPath(int n, vvd & edges, int source, int destination) { - vector<int> ds(n, -1); - for (auto &e : edges) { - int p1 = find(ds, e[0]), p2 = find(ds, e[1]); - if (p1 != p2) - ds[p2] = p1; - } - return find(ds, source) == find(ds, destination); - } - -private: - int find(vector<int> &ds, int i) { - return ds[i] < 0 ? i : ds[i] = find(ds, ds[i]); - } -}; - -int main() { - Solution obj; - vvd edges = {{0, 1}, {1, 2}, {2, 0}}; - if (obj.validPath(3, edges, 0, 2)) - cout << "true"; - else - cout << "false"; -} |