399. Evaluate Division

1.问题描述
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

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.

2.解决思路
利用哈希表构造图，然后使用深度优先算法遍历。

3.代码

class Solution {
public:
    vector<double> calcEquation(vector<pair<string, string>> equations, vector<double>& values, vector<pair<string, string>> queries) {
        map<string,map<string,double>> hash;
        for (int i = 0; i < equations.size(); ++i) {
            hash[equations[i].first].insert(make_pair(equations[i].second,values[i]));
            if (values[i] != 0)
                hash[equations[i].second].insert(make_pair(equations[i].first,1/values[i]));
        }
        vector<double> res;
        for (auto i : queries) {
            set<string> s;
            double tmp = dfs(i.first,i.second,hash,s);
            if (tmp) res.push_back(tmp);
            else
                res.push_back(-1.0);
        }
        return res;
    }
    double dfs(string beg,string end, map<string,map<string,double>>& hash,set<string>& s) {
        if(hash[beg].find(end) != hash[beg].end())
            return hash[beg][end];
        for (auto i : hash[beg]) {
            if (s.find(i.first) == s.end()) {
                s.insert(i.first);
                double tmp = dfs(i.first,end,hash,s);
                if (tmp) return i.second*tmp;
            }
        }
        return 0;
    }
};