-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathEvaluateDivision.py
46 lines (35 loc) · 1.24 KB
/
EvaluateDivision.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
def dfs(self, node: str, dest: str, gr: dict, vis: set, ans: List[float], temp: float) -> None:
if node in vis:
return
vis.add(node)
if node == dest:
ans[0] = temp
return
for ne, val in gr[node].items():
self.dfs(ne, dest, gr, vis, ans, temp * val)
def buildGraph(self, equations: List[List[str]], values: List[float]) -> dict:
gr = {}
for i in range(len(equations)):
dividend, divisor = equations[i]
value = values[i]
if dividend not in gr:
gr[dividend] = {}
if divisor not in gr:
gr[divisor] = {}
gr[dividend][divisor] = value
gr[divisor][dividend] = 1.0 / value
return gr
def calcEquation(self, equations: List[List[str]], values: List[float], queries: List[List[str]]) -> List[float]:
gr = self.buildGraph(equations, values)
finalAns = []
for query in queries:
dividend, divisor = query
if dividend not in gr or divisor not in gr:
finalAns.append(-1.0)
else:
vis = set()
ans = [-1.0]
temp = 1.0
self.dfs(dividend, divisor, gr, vis, ans, temp)
finalAns.append(ans[0])
return finalAns