Disjoint Union Set 并查集

最新推荐文章于 2024-08-20 12:10:14 发布

sesiria

最新推荐文章于 2024-08-20 12:10:14 发布

阅读量388

点赞数

分类专栏： C++ Algorithm 文章标签：并查集 UnionFind

本文链接：https://blog.csdn.net/sesiria/article/details/103491805

版权

该博客介绍了如何使用并查集（Disjoint Union Set）解决关于变量比例关系的方程查询问题。在给定的示例中，通过并查集处理方程如 a / b = 2.0 和 b / c = 3.0，然后回答一系列查询，如 a / c、b / a 等，返回相应的比例结果或 -1.0 表示答案不存在。输入包括方程、比例值和查询，保证了无零除和矛盾的情况。

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

Equations are given in the format A / B = k, where A and B are variables represented as strings, and k is a real number (floating point number). Given some queries, return the answers. If the answer does not exist, return -1.0.

Example:
Given a / b = 2.0, b / c = 3.0.
queries are: a / c = ?, b / a = ?, a / e = ?, a / a = ?, x / x = ? .
return [6.0, 0.5, -1.0, 1.0, -1.0 ].

The input is: vector<pair<string, string>> equations, vector<double>& values, vector<pair<string, string>> queries , where equations.size() == values.size(), and the values are positive. This represents the equations. Return vector<double>.

According to the example above:

equations = [ ["a", "b"], ["b", "c"] ],
values = [2.0, 3.0],
queries = [ ["a", "c"], ["b", "a"], ["a", "e"], ["