LeetCode部分题解

LeetCode Algorithm部分.399

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

The input is always valid. You may assume that evaluating the queries will result in no division by zero and there is no contradiction.

该题的题意为给出几对两数的除及对应值，求给出的几对两数的除。简单分析可得，此问题是带权图的问题，可通过DFS，union-find等方法实现
下面是DFS

  vector<double>& values, vector<pair<string, string>> query) 
    {
        unordered_map<string,unordered_map<string, double>> m;
        vector<double> res;
        for (int i = 0; i < values.size(); ++i)
        {
            m[equations[i].first].insert(make_pair(equations[i].second,values[i]));
            if(values[i]!=0)
                m[equations[i].second].insert(make_pair(equations[i].first,1/values[i]));
        }

        for (auto i : query)
        {
            unordered_set<string> s;
            double tmp = check(i.first,i.second,m,s);
            if(tmp) res.push_back(tmp);
            else res.push_back(-1);
        }
        return res;
    }

    double check(string up, string down, 
            unordered_map<string,unordered_map<string, double>> &m,
            unordered_set<string> &s)
    {
        if(m[up].find(down) != m[up].end()) return m[up][down];
        for (auto i : m[up])
        {
            if(s.find(i.first) == s.end())
            {
                s.insert(i.first);
                double tmp = check(i.first,down,m,s);
                if(tmp) return i.second*tmp;
            }
        }
        return 0;
    }

下面是BFS

vector<double> calcEquation(vector<pair<string, string>> equations, vector<double>& values, vector<pair<string, string>> query) {
        unordered_map<string,unordered_map<string,double>> g;
        for(int i=0;i<equations.size();i++){
            g[equations[i].first].emplace(equations[i].second,values[i]);
            g[equations[i].first].emplace(equations[i].first,1.0);
            g[equations[i].second].emplace(equations[i].first,1.0/values[i]);
            g[equations[i].second].emplace(equations[i].second,1.0);
        }

        vector<double> res;
        for(auto item:query){
            if(!g.count(item.first)||!g.count(item.second)) res.push_back(-1.0);
            else{
                queue<pair<string,double>> qs;
                unordered_set<string> used;
                qs.push({item.first,1.0});
                used.insert(item.first);
                bool find = false;
                while(!qs.empty()&&!find){
                    queue<pair<string,double>> nex;
                    while(!qs.empty()&&!find){
                        pair<string,double> tp = qs.front();
                        qs.pop();

                        //check whether we find the divident
                        if(tp.first == item.second){
                            find = true;
                            res.push_back(tp.second);
                            break;
                        }

                        for(pair<string,double> values:g[tp.first]){
                            if(used.find(values.first) == used.end()){
                                values.second *= tp.second;
                                nex.push(values);
                                used.insert(values.first);
                            }
                        }
                    }

                    qs = nex;
                }

                if(!find) res.push_back(-1.0);
            }
        }

        return res;
    }

还有Union-find（并查集）

     vector<double> calcEquation(vector<pair<string, string>> equations, vector<double>& values, vector<pair<string, string>> queries) {
        unordered_map<string, Node*> map;
        vector<double> res;
        for (int i = 0; i < equations.size(); i ++) {
            string s1 = equations[i].first, s2 = equations[i].second;
            if (map.count(s1) == 0 && map.count(s2) == 0) {
                map[s1] = new Node();
                map[s2] = new Node();
                map[s1] -> value = values[i];
                map[s2] -> value = 1;
                map[s1] -> parent = map[s2];
            } else if (map.count(s1) == 0) {
                map[s1] = new Node();
                map[s1] -> value = map[s2] -> value * values[i];
                map[s1] -> parent = map[s2];
            } else if (map.count(s2) == 0) {
                map[s2] = new Node();
                map[s2] -> value = map[s1] -> value / values[i];
                map[s2] -> parent = map[s1];
            } else {
                unionNodes(map[s1], map[s2], values[i], map);
            }
        }

        for (auto query : queries) {
            if (map.count(query.first) == 0 || map.count(query.second) == 0 || findParent(map[query.first]) != findParent(map[query.second]))
                res.push_back(-1);
            else
                res.push_back(map[query.first] -> value / map[query.second] -> value);
        }
        return res;
    }

private:
    struct Node {
        Node* parent;
        double value = 0.0;
        Node()  {parent = this;}
    };

    void unionNodes(Node* node1, Node* node2, double num, unordered_map<string, Node*>& map) {
        Node* parent1 = findParent(node1), *parent2 = findParent(node2);
        double ratio = node2 -> value * num / node1 -> value;
        for (auto it = map.begin(); it != map.end(); it ++)
            if (findParent(it -> second) == parent1)
                it -> second -> value *= ratio;
        parent1 -> parent = parent2;
    }

    Node* findParent(Node* node) {
        if (node -> parent == node)
            return node;
        node -> parent = findParent(node -> parent);
        return node -> parent;
    }

感觉此题解法很多，所以整理了一下，不少部分算法是借鉴他人。