zoukankan      html  css  js  c++  java
  • 399. 除法求值

    给出方程式 A / B = k, 其中 A 和 B 均为用字符串表示的变量, k 是一个浮点型数字。根据已知方程式求解问题,并返回计算结果。如果结果不存在,则返回 -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 <= equations[i][0].length, equations[i][1].length <= 5
    values.length == equations.length
    0.0 < values[i] <= 20.0
    1 <= queries.length <= 20
    queries[i].length == 2
    1 <= queries[i][0].length, queries[i][1].length <= 5
    equations[i][0], equations[i][1], queries[i][0], queries[i][1] 由小写英文字母与数字组成

    Floyd

    from collections import defaultdict
    
    class Solution:
        def calcEquation(self, equations: List[List[str]], values: List[float], queries: List[List[str]]) -> List[float]:
            edges=defaultdict(dict)
            verts=set()
    
            for (a,b),c in zip(equations,values):
                verts.add(a)
                verts.add(b)
    
                edges[a][b]=c
                edges[b][a]=1/c
    
            for k in verts:
                ek=edges[k]
                for i in verts:
                    if i==k:
                        continue
                    
                    ei=edges[i]
                    for j in verts:
                        if k==j or i==j or j in ei:
                            continue
    
                        if k in ei and j in ek:
                            ei[j]=ei[k]*ek[j]
                    
            res=[]
            for a,b in queries:
                if a in edges and b in edges[a]:
                    res.append(edges[a][b])
                elif a==b and a in verts and b in verts:
                    res.append(1)
                else:
                    res.append(-1)
    
            return res

  • 相关阅读:
    游戏中调用SDK提供的支付接口 头文件的包含
    sdk支付结果 调用游戏中的回调
    escplise 下新添加c++代码的处理
    rapidjson的read和write的sample
    cocos2d-x 3.0 场景切换特效汇总
    Eclipse 打开文件所在位置
    eclipse及其Java环境搭理
    rust cargo build一直出现 Blocking waiting for file lock on package cache
    rust随笔
    cmake 安装一个目录下的图片 到另一个目录文件中去
  • 原文地址:https://www.cnblogs.com/xxxsans/p/13767801.html
Copyright © 2011-2022 走看看