LeetCode.399 Evaluate Division（评估除法）

1.题目

You are given an array of variable pairs equations and an array of real numbers values, where equations[i] = [Ai, Bi] and values[i] represent the equation Ai / Bi = values[i]. Each Ai or Bi is a string that represents a single variable.

You are also given some queries, where queries[j] = [Cj, Dj] represents the jth query where you must find the answer for Cj / Dj = ?.

Return the answers to all queries. If a single answer cannot be determined, return -1.0.

Note: The input is always valid. You may assume that evaluating the queries will not result in division by zero and that there is no contradiction.

2.样例

Example 1:

Input: equations = [["a","b"],["b","c"]], values = [2.0,3.0], queries = [["a","c"],["b","a"],["a","e"],["a","a"],["x","x"]]
Output: [6.00000,0.50000,-1.00000,1.00000,-1.00000]
Explanation: 
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 ]

Example 2:

Input: equations = [["a","b"],["b","c"],["bc","cd"]], values = [1.5,2.5,5.0], queries = [["a","c"],["c","b"],["bc","cd"],["cd","bc"]]
Output: [3.75000,0.40000,5.00000,0.20000]

Example 3:

Input: equations = [["a","b"]], values = [0.5], queries = [["a","b"],["b","a"],["a","c"],["x","y"]]
Output: [0.50000,2.00000,-1.00000,-1.00000]

Constraints:

• 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 consist of lower case English letters and digits.

3.代码及思路

• 1.对输入equations建立双向的二为矩阵，矩阵的值为两数相除的结果（将结果存入一个map中）。
• 2.之后采用dfs遍历要处理的queries，同时为了避免循环查询，采用一个Set来记录已经遍历过的数。
• 3.对于dfs中的count为当前已经处理（处理到当前除数/被除数）的结果。
• 4.代码如下：

class Solution {
   public double[] calcEquation(List<List<String>> equations, double[] values, List<List<String>> queries) {
        // 思路：典型dfs，用map来记录从a->【b,x】的映射value，并且同步记录b->a的映射，采用一个set来记录已经访问过的数据
        Map<String,Map<String,Double>> map=new HashMap<>();
        for(int i=0;i<values.length;i++){
            List<String> list=equations.get(i);
            
            map.putIfAbsent(list.get(0),new HashMap<>());
            map.putIfAbsent(list.get(1),new HashMap<>());
            
            // 值的映射(双向)
            map.get(list.get(0)).put(list.get(1),values[i]);
            map.get(list.get(1)).put(list.get(0),1/values[i]);
        }
        
        double[] res=new double[queries.size()];
        for(int i=0;i<queries.size();i++){
            List<String> query=queries.get(i);
            res[i]=dfs(query.get(0),query.get(1),1,map,new HashSet<>());
        }
        return res;
    }
    
    public double dfs(String start,String end,double count,Map<String,Map<String,Double>> map,Set<String> seen){
        if(!map.containsKey(start)||!seen.add(start)){
            // 不存在起始点，或已经访问过了
            return -1;
        }
        
        if(start.equals(end)){
            return count;
        }
        
        Map<String,Double> next=map.get(start);
        for(String key:next.keySet()){
            double res=dfs(key,end,count*next.get(key),map,seen);
            if(res!=-1){
                return res;
            }
        }
        return -1;
    }
}