[LeetCode]399. Evaluate Division

• descrption
  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。
  思路：将每个除数或被除数当作一个节点，如果从除数到被除数能找到一条路径，证明有结果，否则就返回-1。hash map可以将被除数string a作为key存储除数string b以及商a/b(value)的信息，同时将被除数string b作为key存储除数string a以及商b/a(1/value)的信息。这样通过bfs，找到从a到b的路径，返回时依次返回value并相乘就得到了a/b的值，将值放入存放结果vector中，如果最后没有找到路径，则将 -1存放在结果vector中。

• 代码如下

class Solution {
public:
    vector<double> calcEquation(vector<pair<string, string>> equations, vector<double>& values, vector<pair<string, string>> queries) {
        //store a/b=k
        unordered_map<string, unordered_map<string, double>> map;
        //answer
        vector<double> ans;

        //go over the equations to find all a/b=k
        for(int i = 0; i < equations.size(); i++){
            //store a / b
            map[equations[i].first].insert(make_pair(equations[i].second, values[i]));
            //store b/a
            map[equations[i].second].insert(make_pair(equations[i].first, 1/values[i]));
        }

        //get answers of queries
        for(int i = 0; i < queries.size(); i++){
            //store nodes visited
            set<string> s;
            //dfs to find ans
            double answer = bfs(queries[i].first, queries[i].second, map, s);
            if (answer != 0){
                ans.push_back(answer);
            }
            else ans.push_back(-1);
        }
        return ans;

    }
    double bfs(string first, string second, unordered_map<string, unordered_map<string, double>> map, set<string>& s){
        //find target node
        if(map[first].find(second) != map[first].end())
            return map[first][second];
        for(auto a : map[first]){
            if(s.find(a.first) == s.end()){
                s.insert(a.first);
                double answer = bfs(a.first, second, map, s);
                if(answer != 0){
                    return a.second * answer;
                }
            }
        }
        return 0;
    }
};

原题地址
如有错误请指出，谢谢！