leetcode 399. Evaluate Division (图 + DFS)

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& values, vector<pair<string, string>> queries , where equations.size() == values.size(), and the values are positive. This represents the equations. Return vector.

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”] ].

class Solution {
public:
    vector<double> calcEquation(vector<vector<string>>& equations, vector<double>& values, vector<vector<string>>& queries) {
        vector<double> ans;
        unordered_map<string,  unordered_map<string, double>> graph;
        for(int i = 0; i < equations.size(); i++){
            const string& A = equations[i][0];
            const string& B = equations[i][1];
            const double k = values[i];
            graph[A][B] = k;
            graph[B][A] = 1.0 / k;
            
        }
        
        for(const auto& pair : queries){
            const string& X = pair[0];
            const string& Y = pair[1];
            if(!graph.count(X) || !graph.count(Y)){
                ans.push_back(-1.0);
                continue;
            }
            unordered_set<string> visited;
            ans.push_back(divide(X, Y, graph, visited));
        }
        return ans;
    }
    
    double divide(const string &A, const string &B, unordered_map<string,  unordered_map<string, double>>& graph,  unordered_set<string>& visited){
        if(A == B){
            return 1.0;
        }
        visited.insert(A);
        for(const auto& pair: graph[A]){
            const string& C = pair.first;
            if(visited.count(C)){
                continue;
            }
            double d = divide(C, B, graph, visited);
            if(d > 0){
                return d * graph[A][C];
            }
            
        }
        return -1.0;
    }
};