|
| 1 | +publicclassSolution { |
| 2 | +publicList<Integer>findAllPeople(intn,int[][]meetings,intfirstPerson) { |
| 3 | +Set<Integer>secrets =newHashSet<>(Arrays.asList(0,firstPerson)); |
| 4 | +Map<Integer,Map<Integer,List<Integer>>>timeMap =newHashMap<>(); |
| 5 | + |
| 6 | +for (int[]meeting :meetings) { |
| 7 | +intsrc =meeting[0],dst =meeting[1],time =meeting[2]; |
| 8 | +timeMap.putIfAbsent(time,newHashMap<>()); |
| 9 | +timeMap.get(time).putIfAbsent(src,newArrayList<>()); |
| 10 | +timeMap.get(time).putIfAbsent(dst,newArrayList<>()); |
| 11 | +timeMap.get(time).get(src).add(dst); |
| 12 | +timeMap.get(time).get(dst).add(src); |
| 13 | + } |
| 14 | + |
| 15 | +for (Integertime :newTreeSet<>(timeMap.keySet())) { |
| 16 | +Set<Integer>visit =newHashSet<>(); |
| 17 | +for (Integersrc :timeMap.get(time).keySet()) { |
| 18 | +if (secrets.contains(src)) { |
| 19 | +dfs(src,timeMap.get(time),visit,secrets); |
| 20 | + } |
| 21 | + } |
| 22 | + } |
| 23 | + |
| 24 | +returnnewArrayList<>(secrets); |
| 25 | + } |
| 26 | + |
| 27 | +privatevoiddfs(intsrc,Map<Integer,List<Integer>>adj,Set<Integer>visit,Set<Integer>secrets) { |
| 28 | +if (visit.contains(src)) { |
| 29 | +return; |
| 30 | + } |
| 31 | +visit.add(src); |
| 32 | +secrets.add(src); |
| 33 | +for (Integernei :adj.get(src)) { |
| 34 | +dfs(nei,adj,visit,secrets); |
| 35 | + } |
| 36 | + } |
| 37 | + |
| 38 | +publicstaticvoidmain(String[]args) { |
| 39 | +Solutionsolution =newSolution(); |
| 40 | +intn =5; |
| 41 | +int[][]meetings = { {0,1,2 }, {1,2,3 }, {2,3,4 }, {4,5,5 } }; |
| 42 | +intfirstPerson =1; |
| 43 | +List<Integer>result =solution.findAllPeople(n,meetings,firstPerson); |
| 44 | +System.out.println(result); |
| 45 | + } |
| 46 | +} |