399. Evaluate Division

/*
Equations are given in the format A / B = k, where A and B are variables represented as strings, and k is a real number (floating point number). Given some queries, return the answers. If the answer does not exist, return -1.0.

Example:
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 ].

The input is: vector<pair<string, string>> equations, vector<double>& values, vector<pair<string, string>> queries , where equations.size() == values.size(), and the values are positive. This represents the equations. Return vector<double>.

According to the example above:

equations = [ ["a", "b"], ["b", "c"] ],
values = [2.0, 3.0],
queries = [ ["a", "c"], ["b", "a"], ["a", "e"], ["a", "a"], ["x", "x"] ]. 
The input is always valid. You may assume that evaluating the queries will result in no division by zero and there is no contradiction.

给定几个表达式和相应的值，求解两个变量相除是否存存在值，如果不存在则为-1.0，
在给定的表达式中提取变量作为图的两个节点，在值的集合values中提取相应的值作为两个节点的权值，
构造图；求解两个变量相除的值就转化为求两个变量之间路径的权值相乘的问题,采用DFS或者BFS遍历即可

*/



class Solution {
public:
    vector<double> calcEquation(vector<pair<string, string>> equations, vector<double>& values, vector<pair<string, string>> queries) {
        vector<double> res;
        unordered_map<string,unordered_map<string,double>> mp; //构造邻接链表
        for(int i=0;i<equations.size();i++){
            mp[equations[i].first].insert({equations[i].second,values[i]});
            mp[equations[i].second].insert({equations[i].first,1/values[i]}); //分母 分子不为0
        }
        for(int i=0;i<queries.size();i++){
            unordered_set<string> visit;  //访问标记
            double tmp=dfs(queries[i].first,queries[i].second,mp,visit);
            if(tmp) res.push_back(tmp);
            else res.push_back(-1.0);
        }
        return res;
    }
    double dfs(string numerator,string denominator,unordered_map<string,unordered_map<string, double>>& mp,unordered_set<string>& visit){
        if(mp.find(numerator)!=mp.end() && mp[numerator].find(denominator) != mp[numerator].end()) return mp[numerator][denominator];
        for(auto deno : mp[numerator]){
            if(visit.find(deno.first) == visit.end()){
                visit.insert(deno.first);
                double tmp=dfs(deno.first,denominator,mp,visit);
                if(tmp) return tmp*deno.second;
            }
        }
        return 0;
    }
};