每日一题 leetcode 399
题目描述:
给你一个变量对数组 equations 和一个实数值数组 values 作为已知条件,
其中 equations[i] = [Ai, Bi] 和 values[i] 共同表示等式 Ai / Bi = values[i] 。
每个 Ai 或 Bi 是一个表示单个变量的字符串。
另有一些以数组 queries 表示的问题,其中 queries[j] = [Cj, Dj] 表示第 j 个问题,
请你根据已知条件找出 Cj / Dj = ? 的结果作为答案。
返回 所有问题的答案 。如果存在某个无法确定的答案,则用 -1.0 替代这个答案。
注意:输入总是有效的。你可以假设除法运算中不会出现除数为 0 的情况,且不存在任何矛盾的结果。
示例 1:
输入:
equations = [["a","b"],["b","c"]], values = [2.0,3.0], queries = [["a","c"],["b","a"],["a","e"],["a","a"],["x","x"]]
输出:
[6.00000,0.50000,-1.00000,1.00000,-1.00000]
解释:
条件:a / b = 2.0, b / c = 3.0
问题:a / c = ?, b / a = ?, a / e = ?, a / a = ?, x / x = ?
结果:[6.0, 0.5, -1.0, 1.0, -1.0 ]
示例 2:
输入:
equations = [["a","b"],["b","c"],["bc","cd"]], values = [1.5,2.5,5.0], queries = [["a","c"],["c","b"],["bc","cd"],["cd","bc"]]
输出:[3.75000,0.40000,5.00000,0.20000]
示例 3:
输入:
equations = [["a","b"]], values = [0.5], queries = [["a","b"],["b","a"],["a","c"],["x","y"]]
输出:[0.50000,2.00000,-1.00000,-1.00000]
提示:
1 <= equations.length <= 20
equations[i].length == 2
1 <= Ai.length, Bi.length <= 5
values.length == equations.length
0.0 < values[i] <= 20.0
1 <= queries.length <= 20
queries[i].length == 2
1 <= Cj.length, Dj.length <= 5
Ai, Bi, Cj, Dj 由小写英文字母与数字组成
简单解释下,equations 就是一组成对的变量, 比如是a,b。第i对变量对应values[i]就是a/b的值,
然后queries 就是一组要求的值
实现代码:
//如果给出a/b就能得到b/a,而已知a/b,b/c则可以由(a/b)*(b/c)得出a/c,所以求a/c问题
//相当于求一个图中a->c的路径的乘积。用DFS求路径,要注意图中可能有环
func calcEquation(equations [][]string, values []float64, queries [][]string) []float64 {
ret := []float64{}
id := map[string]int{}
n := 0
for i := 0; i < len(equations); i++ {
a, b := equations[i][0], equations[i][1]
if _, ok := id[a]; !ok {
id[a] = n
n++
}
if _, ok := id[b]; !ok {
id[b] = n
n++
}
}
g := make([][]float64, n)
for i := 0; i < n; i++ {
g[i] = make([]float64, n)
}
for i := 0; i < len(equations); i++ {
a, b := id[equations[i][0]], id[equations[i][1]]
g[a][b] = values[i]
g[b][a] = 1.0 / values[i]
}
for i := 0; i < len(queries); i++ {
if _, ok := id[queries[i][0]]; !ok {
ret = append(ret, -1)
continue
}
if _, ok := id[queries[i][1]]; !ok {
ret = append(ret, -1)
continue
}
visited := make([]bool, n)
a, b := id[queries[i][0]], id[queries[i][1]]
visited[a] = true
ret = append(ret, getPathMult(g, visited, a, b))
}
return ret
}
func getPathMult(g [][]float64, visited []bool, a, b int) float64 {
if g[a][b] > 0 {
return g[a][b]
}
for i := 0; i < len(g[a]); i++ {
if g[a][i] > 0 {
if visited[i] {
continue
}
visited[i] = true
r := getPathMult(g, visited, i, b)
if r > 0 {
return r * g[a][i]
}
visited[i] = false
}
}
return -1
}
结果:
提交记录
22 / 22 个通过测试用例
状态:通过
执行用时: 0 ms
内存消耗: 2.1 MB