MCPcopy Create free account
hub / github.com/StudyRust/leetcode_rust / dfs

Function dfs

841-keys-and-rooms.rs:4–13  ·  view source on GitHub ↗
(mmp: &mut HashSet<i32>, rooms: &Vec<Vec<i32>>, key: i32)

Source from the content-addressed store, hash-verified

2 use std::collections::HashSet;
3 let mut mmp: HashSet<i32> = HashSet::new();
4 pub fn dfs(mmp: &mut HashSet<i32>, rooms: &Vec<Vec<i32>>, key: i32) {
5 let keys = rooms.get(key as usize);
6 if keys == None { return }
7 for key in keys.unwrap() {
8 let tmp = mmp.get(key);
9 if tmp.is_some() { continue }
10 mmp.insert(*key);
11 dfs(mmp, rooms, *key);
12 }
13 }
14 dfs(&mut mmp, &rooms, 0);
15 let mut mmp = mmp.into_iter().collect::<Vec<i32>>();
16 mmp.sort();

Callers 1

can_visit_all_roomsFunction · 0.85

Calls 2

getMethod · 0.80
insertMethod · 0.80

Tested by

no test coverage detected