Evaluate Division
来源:互联网 发布:淘宝一块钱包邮的东西 编辑:程序博客网 时间:2024/05/29 03:16
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<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; }};
0 0
- Evaluate Division
- Evaluate Division
- Evaluate Division
- Evaluate Division
- Evaluate Division
- Evaluate Division
- Evaluate Division
- Evaluate Division
- Evaluate Division
- Evaluate Division
- Evaluate Division
- 【Leetcode】399. Evaluate Division
- [leetcode]399. Evaluate Division
- 399. Evaluate Division
- leetcode:399. Evaluate Division
- [Leetcode 399]Evaluate Division
- 399. Evaluate Division
- LeetCode 399. Evaluate Division
- LTspice introduction
- 转载:stm32 数据类型的定义(常用的U8,U16,U32到底代表什么)
- 2017实习生面试经历
- 多种数据库添加自增主键
- stdafx.h的作用
- Evaluate Division
- Mac下同时安装切换多个版本的JDK
- bzoj1499: [NOI2005]瑰丽华尔兹
- 手机wap端开发微信绑定第三方登陆功能
- 【JSP页面】利用数据库中的表格中的数据实现验证用户名和密码
- lua ... (变长参数)
- Android
- 从MySQL 5.7 版本以后,不再含有 data 目录
- 杭电oj(Java版)—— 1034 Candy Sharing Game