试题历届真题【第十二届】【省赛】【A组】JAVA 蓝桥杯

最新推荐文章于 2022-04-05 15:40:51 发布

积-少-成-多

最新推荐文章于 2022-04-05 15:40:51 发布

阅读量543

点赞数

文章标签： java 蓝桥杯算法回归算法 eclipse

本文链接：https://blog.csdn.net/weixin_43384365/article/details/123604802

版权

该篇博客探讨了一种利用HashMap和深度优先搜索（DFS）解决寻找子节点最大深度的问题。代码实现中，输入整数n表示节点数，通过 DFS 递归遍历所有子节点，计算并返回最大深度。此算法适用于树形结构数据的深度分析。

摘要由CSDN通过智能技术生成



package zhenti;

import java.util.ArrayList;
import java.util.HashMap;
import java.util.Scanner;

public class zuohaiziyouxiangdi{
	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		int n = scanner.nextInt();
		HashMap<Integer, ArrayList<Integer>> hashMap = new HashMap<>();
		for (int zijiedian = 2; zijiedian <= n; zijiedian++) {
			int fujiedian = scanner.nextInt();
			hashMap.putIfAbsent(fujiedian, new ArrayList<>());
			hashMap.get(fujiedian).add(zijiedian);
		}
		int ans = dfs(1, hashMap);
		System.out.println(ans);
	}
	
	public static int dfs(int fujiedian, HashMap<Integer,ArrayList<Integer>> hashMap) {
		if (!hashMap.containsKey(fujiedian)) {
			return 0;
		}else {
			ArrayList<Integer> zijiediansArrayList = hashMap.get(fujiedian);
			int zijiediangeshu = zijiediansArrayList.size();
			int zishuzuida = 0;
			for(Integer zijiedian: zijiediansArrayList) {
				zishuzuida = Math.max(dfs(zijiedian, hashMap), zishuzuida);
			}
			return zijiediangeshu + zishuzuida;
		}
	}
}