399. 除法求值

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 替代这个答案。如果问题中出现了给定的已知条件中没有出现的字符串，也需要用 -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 由小写英文字母与数字组成

解答：

class UnionFind{
    private int[] parent;
    private double[] weight;
    
    public UnionFind(int n){
        this.parent = new int[n];
        this.weight = new double[n];
        for(int i = 0; i < n; i++){
            parent[i] = i;
            weight[i] = 1.0d;
        }
    }
    
    public int find(int x){
        if(x != parent[x]){
            int origin = parent[x];
            parent[x] = find(parent[x]);
            weight[x] *= weight[origin];
        }
        return parent[x];
    }
    
    public void union(int x, int y, double value){
        int rootX = find(x);
        int rootY = find(y);
        if(rootX == rootY) return;
        parent[rootX] = rootY;
        weight[rootX] = weight[y] * value / weight[x];
    }
    
    public double isConnected(int x, int y){
        int rootX = find(x);
        int rootY = find(y);
        if(rootX == rootY) return weight[x] / weight[y];
        else return -1.0d;
    }
}

class Solution {
    //带权并查集
    //时间复杂度O(ML+N+MlogN+Q⋅(L+logN)),空间复杂度O(NL)
    public double[] calcEquation(List<List<String>> equations, double[] values, List<List<String>> queries) {
        int equationsSize = equations.size();
        UnionFind uf = new UnionFind(2 * equationsSize);
        Map<String, Integer> hashMap = new HashMap<>();
        int id = 0;
        for(int i = 0; i < equationsSize; i++){
            List<String> equation = equations.get(i);
            String var1 = equation.get(0);
            String var2 = equation.get(1);
            
            if(!hashMap.containsKey(var1)){
                hashMap.put(var1, id);
                id++;
            }
            if(!hashMap.containsKey(var2)){
                hashMap.put(var2, id);
                id++;
            }
            uf.union(hashMap.get(var1), hashMap.get(var2), values[i]);
        }
        
        int queriesSize = queries.size();
        double[] ans = new double[queriesSize];
        for(int i = 0; i < queriesSize; i++){
            String var1 = queries.get(i).get(0);
            String var2 = queries.get(i).get(1);
            Integer id1 = hashMap.get(var1);
            Integer id2 = hashMap.get(var2);
            
            if(id1 == null || id2 == null){
                ans[i] = -1.0d;
            }else{
                ans[i] = uf.isConnected(id1, id2);
            }
        }
        return ans;
    }
}

参考自：

作者：LeetCode-Solution
链接：https://leetcode-cn.com/problems/evaluate-division/solution/chu-fa-qiu-zhi-by-leetcode-solution-8nxb/
来源：力扣（LeetCode）
著作权归作者所有。商业转载请联系作者获得授权，非商业转载请注明出处。