两重map的使用以及BFS的使用

399. Evaluate Division

Medium

123497FavoriteShare

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

class Solution {
public:
    vector<double> calcEquation(vector<vector<string>>& equations, vector<double>& values, vector<vector<string>>& queries) {
        unordered_map<string, unordered_map<string, double>> graph;
        for (int i = 0; i < equations.size(); i++) {
            graph[equations[i][0]][equations[i][1]] = values[i];
            graph[equations[i][1]][equations[i][0]] = 1.0 / values[i];
            graph[equations[i][0]][equations[i][0]] = 1.0;
            graph[equations[i][1]][equations[i][1]] = 1.0;
        }

        vector<double> Result;
        for (auto query : queries) {
            if (graph.count(query[0]) == 0 || graph.count(query[1]) == 0)
            {
                Result.push_back(-1.0);
                continue;
            }
            queue<pair<string, double>> q;
            unordered_set<string> s;
            string a = query[0];//定义被除数
            string b = query[1];//定义除数
            q.push(make_pair( a,1.0 ));
            bool FindResult = false;
            while (!q.empty()) {
                pair<string, double> tmp = q.front();
                q.pop();
                if (tmp.first == b) {
                    Result.push_back(tmp.second);
                    FindResult = true;
                    break;
                }
                s.insert(tmp.first);
                for (pair<string, double> sub : graph[tmp.first]) {
                    if (s.count(sub.first) == 0) {//sub.first没有被访问
                        s.insert(sub.first);
                        sub.second = sub.second * tmp.second;
                        q.push({ sub.first,sub.second });
                    }
                }
            }
            if (!FindResult) {
                Result.push_back(-1.0);
            }
        }
        return Result;
    }
};

此题反思：这道题主要考察数据结构，其实这道题是一个图Graph，每一个unordered_map里面存放的是一个pair对。通过队列实现BFS遍历，通过unordered_set记录当前节点是否被访问。感觉难度不小，收获也蛮多的！