DFS - 开数组记录路径 - Tree of Coprimes(hard) - Biweekly Contest 46

马各阿牛

于 2021-02-21 10:23:34 发布

阅读量196

点赞数 1

分类专栏：算法与数据结构文章标签： leetcode 算法

本文链接：https://blog.csdn.net/weianluo/article/details/113914268

版权

本文介绍了一种算法，针对给定树结构中的节点值，寻找每个节点与其互质祖先之间的最近距离。通过改进搜索策略和数据结构，解决了TLE问题，提升了效率。讨论了如何利用欧几里得算法计算最大公约数，并应用到深度优先搜索中。

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

There is a tree (i.e., a connected, undirected graph that has no cycles) consisting of n nodes numbered from 0 to n - 1 and exactly n - 1 edges. Each node has a value associated with it, and the root of the tree is node 0.

To represent this tree, you are given an integer array nums and a 2D array edges. Each nums[i] represents the ith node's value, and each edges[j] = [uj, vj] represents an edge between nodes uj and vj in the tree.

Two values x and y are coprime if gcd(x, y) == 1 where gcd(x, y) is the greatest common divisor of x and y.

An ancestor of a node i is any other node on the shortest path from node i to the root. A node is not considered an ancestor of itself.

Return an array ans of size n, where ans[i] is the closest ancestor to node i such that nums[i] and nums[ans[i]] are