From a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 Mon Sep 17 00:00:00 2001 From: Jack Sangdahl Date: Fri, 27 Jun 2025 12:23:02 -0600 Subject: chore: remove old cpp and rust solutions --- other/min_time_apples_tree.rs | 47 ------------------------------------------- 1 file changed, 47 deletions(-) delete mode 100644 other/min_time_apples_tree.rs (limited to 'other/min_time_apples_tree.rs') diff --git a/other/min_time_apples_tree.rs b/other/min_time_apples_tree.rs deleted file mode 100644 index 537e5cc..0000000 --- a/other/min_time_apples_tree.rs +++ /dev/null @@ -1,47 +0,0 @@ -use std::collections::HashSet; -struct Solution; - -impl Solution { - pub fn min_time(n: i32, edges: Vec>, has_apple: Vec) -> i32 { - let mut adj_list: Vec> = vec![vec![]; n as usize]; - for e in edges { - adj_list[e[0] as usize].push(e[1]); - adj_list[e[1] as usize].push(e[0]); - } - let mut total = 0i32; - let mut vis: HashSet = HashSet::new(); - Self::dfs(0, adj_list, &mut vis, has_apple, &mut total); - total - } - fn dfs(node: i32, adj_list: Vec>, vis: &mut HashSet, - has_apple: Vec, total: &mut i32) -> bool { - let mut res = false; - if has_apple[node as usize] { - res = true; - } - vis.insert(node); - for i in &adj_list[node as usize] { - if !vis.contains(&i) { - if Self::dfs(*i, adj_list, vis, has_apple, total) { - *total += 2; - res = true; - } - } - } - res - } -} - -fn main() { - let edges = vec![ - vec![0,1], vec![0,2], - vec![1,4], vec![1,5], - vec![2,3], vec![2,6] - ]; - let has_apple1 = vec![false,false,true,false,true,true,false]; - let has_apple2 = vec![false,false,true,false,false,true,false]; - let has_apple3 = vec![false,false,false,false,false,false,false]; - println!("{}", Solution::min_time(7, edges, has_apple1)); //expect: 8 - println!("{}", Solution::min_time(7, edges, has_apple2)); //expect: 6 - println!("{}", Solution::min_time(7, edges, has_apple3)); //expect: 0 -} -- cgit v1.2.3