|
19 | 19 |
|
20 | 20 | public class Test2 { |
21 | 21 |
|
22 | | - public List<String> findItinerary(String[][] tickets) { |
23 | | - HashMap<String, ArrayList<String>> map = new HashMap<>(); |
24 | | - for (String[] ticket : tickets) { |
25 | | - map.computeIfAbsent(ticket[0], k -> new ArrayList<>()).add(ticket[1]); |
| 22 | + public double[] calcEquation(String[][] equations, double[] values, String[][] queries) { |
| 23 | + HashMap<String, HashMap<String, Double>> valueMap = new HashMap<>(); |
| 24 | + |
| 25 | + for (int i = 0; i < equations.length; i++) { |
| 26 | + String[] equation = equations[i]; |
| 27 | + HashMap<String, Double> map = valueMap.computeIfAbsent(equation[0], k -> new HashMap<>()); |
| 28 | + map.put(equation[1], values[i]); |
| 29 | + map = valueMap.computeIfAbsent(equation[1], k -> new HashMap<>()); |
| 30 | + map.put(equation[0], 1 / values[i]); |
26 | 31 | } |
27 | | - for (List<String> list : map.values()) { |
28 | | - Collections.sort(list); |
| 32 | + |
| 33 | + double[] result = new double[queries.length]; |
| 34 | + for (int i = 0; i < queries.length; i++) { |
| 35 | + double[] value = new double[] {1.0}; |
| 36 | + result[i] = dfs(valueMap, queries[i][0], queries[i][1], new HashSet<>(), value) ? value[0] : -1.0; |
29 | 37 | } |
30 | | - LinkedList<String> result = new LinkedList<>(Arrays.asList("JFK")); |
31 | | - dfs("JFK", map, result, tickets.length); |
32 | 38 | return result; |
33 | 39 | } |
34 | 40 |
|
35 | | - boolean dfs(String airport, HashMap<String, ArrayList<String>> map, LinkedList<String> route, int n) { |
36 | | - if (route.size() == n + 1) { |
37 | | - return true; |
38 | | - } |
39 | | - if (!map.containsKey(airport) || map.get(airport).isEmpty()) { |
| 41 | + private boolean dfs(HashMap<String, HashMap<String, Double>> map, String start, String end, HashSet<String> set, double[] value) { |
| 42 | + if (!map.containsKey(start) || !map.containsKey(end) || set.contains(start)) { |
40 | 43 | return false; |
41 | 44 | } |
42 | | - ArrayList<String> list = map.get(airport); |
43 | | - for (int i = 0; i < list.size(); i++) { |
44 | | - String target = list.remove(i); |
45 | | - |
46 | | - route.add(target); |
47 | | - if (dfs(target, map, route, n)) { |
48 | | - return true; |
| 45 | + if (start.equals(end)) { |
| 46 | + return true; |
| 47 | + } |
| 48 | + set.add(start); |
| 49 | + HashMap<String, Double> valueMap = map.get(start); |
| 50 | + boolean flag = false; |
| 51 | + for (Map.Entry<String, Double> entry : valueMap.entrySet()) { |
| 52 | + value[0] *= entry.getValue(); |
| 53 | + if (dfs(map, entry.getKey(), end, set, value)) { |
| 54 | + flag = true; |
| 55 | + break; |
49 | 56 | } |
50 | | - route.removeLast(); |
51 | | - |
52 | | - list.add(i, target); |
| 57 | + value[0] /= entry.getValue(); |
53 | 58 | } |
54 | | - return false; |
| 59 | + set.remove(start); |
| 60 | + return flag; |
55 | 61 | } |
56 | 62 | } |
0 commit comments