399. Evaluate Division
- Total Accepted: 12791
- Total Submissions: 31902
- Difficulty: Medium
- Contributors: Admin
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"], ["a", "a"], ["x", "x"] ].
The input is always valid. You may assume that evaluating the queries will result in no division by zero and there is no contradiction.
题解:这道题首先想到把给的equations转换成图的形式,a/b有值就相当于a到b有边,再通过类似Floyd算法把本来没有边但可以通过别的顶点相连的两个顶点连起来。
按照这个思路,第一个问题是图是用邻接矩阵储存,那么下标就是int类型,但给的顶点是string类型,于是用map把string映射到int。
第二个问题是不能直接套Floyd算法,因为这里不存在最短,不管怎么走都是一样长的,只需要改一下,只要本来本没有边,就可以替代掉。
并且,在“mat[i][j] > mat[i][k] + mat[k][j]”这里也要把+改成*,因为a/c = a/b * b/c。代码如下: