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/sum_dist_tree.rs | 49 ------------------------------------------------- 1 file changed, 49 deletions(-) delete mode 100644 other/sum_dist_tree.rs (limited to 'other/sum_dist_tree.rs') diff --git a/other/sum_dist_tree.rs b/other/sum_dist_tree.rs deleted file mode 100644 index d000d83..0000000 --- a/other/sum_dist_tree.rs +++ /dev/null @@ -1,49 +0,0 @@ -struct Solution; - -impl Solution { - pub fn sum_of_distances_in_tree(n: i32, edges: Vec>) -> Vec { - let n = n as usize; - let mut adj: Vec> = vec![Vec::new(); n]; - for e in edges.iter() { - adj[e[0] as usize].push(e[1] as usize); - adj[e[1] as usize].push(e[0] as usize); - } - let mut dp = vec![[0; 2]; n]; - Self::get_depth_sum_count(0, n, &mut dp, &adj); - let mut ans = vec![0; n]; - Self::get_ans(0, n, 0, &mut ans, &dp, &adj); - ans - } - fn get_depth_sum_count(i: usize, parent: usize, dp: &mut Vec<[i32; 2]>, adj: &Vec>) { - dp[i][1] = 1; - for &j in adj[i].iter() { - if j == parent { - continue; - } - Self::get_depth_sum_count(j, i, dp, adj); - dp[i][0] += dp[j][0] + dp[j][1]; - dp[i][1] += dp[j][1]; - } - } - fn get_ans(i: usize, parent: usize, acc_sum: i32, ans: &mut Vec, dp: &Vec<[i32; 2]>, adj: &Vec>) { - ans[i] = acc_sum + dp[i][0]; - for &j in adj[i].iter() { - if j == parent { - continue; - } - let sum2 = acc_sum + dp[i][0] + dp.len() as i32 - dp[j][0] - dp[j][1] * 2; - Self::get_ans(j, i, sum2, ans, dp, adj); - } - } -} - -fn main() { - let edges = vec![ - vec![0,1], - vec![0,2], - vec![2,3], - vec![2,4], - vec![2,5] - ]; - print!("{:?}", Solution::sum_of_distances_in_tree(6, edges)); -} -- cgit v1.2.3