{"id":8859,"date":"2021-11-28T09:44:35","date_gmt":"2021-11-28T17:44:35","guid":{"rendered":"https:\/\/zxi.mytechroad.com\/blog\/?p=8859"},"modified":"2021-11-28T09:45:33","modified_gmt":"2021-11-28T17:45:33","slug":"leetcode-2092-find-all-people-with-secret","status":"publish","type":"post","link":"https:\/\/zxi.mytechroad.com\/blog\/graph\/leetcode-2092-find-all-people-with-secret\/","title":{"rendered":"\u82b1\u82b1\u9171 LeetCode 2092. Find All People With Secret"},"content":{"rendered":"\n

You are given an integer n<\/code> indicating there are n<\/code> people numbered from 0<\/code> to n - 1<\/code>. You are also given a 0-indexed<\/strong> 2D integer array meetings<\/code> where meetings[i] = [xi<\/sub>, yi<\/sub>, timei<\/sub>]<\/code> indicates that person xi<\/sub><\/code> and person yi<\/sub><\/code> have a meeting at timei<\/sub><\/code>. A person may attend multiple meetings<\/strong> at the same time. Finally, you are given an integer firstPerson<\/code>.<\/p>\n\n\n\n

Person 0<\/code> has a secret<\/strong> and initially shares the secret with a person firstPerson<\/code> at time 0<\/code>. This secret is then shared every time a meeting takes place with a person that has the secret. More formally, for every meeting, if a person xi<\/sub><\/code> has the secret at timei<\/sub><\/code>, then they will share the secret with person yi<\/sub><\/code>, and vice versa.<\/p>\n\n\n\n

The secrets are shared instantaneously<\/strong>. That is, a person may receive the secret and share it with people in other meetings within the same time frame.<\/p>\n\n\n\n

Return a list of all the people that have the secret after all the meetings have taken place. <\/em>You may return the answer in any order<\/strong>.<\/p>\n\n\n\n

Example 1:<\/strong><\/p>\n\n\n\n

Input:<\/strong> n = 6, meetings = [[1,2,5],[2,3,8],[1,5,10]], firstPerson = 1\nOutput:<\/strong> [0,1,2,3,5]\nExplanation:\n<\/strong>At time 0, person 0 shares the secret with person 1.\nAt time 5, person 1 shares the secret with person 2.\nAt time 8, person 2 shares the secret with person 3.\nAt time 10, person 1 shares the secret with person 5.\u200b\u200b\u200b\u200b\nThus, people 0, 1, 2, 3, and 5 know the secret after all the meetings.\n<\/pre>\n\n\n\n
Example 2:<\/strong><\/p>\n\n\n\n
Input:<\/strong> n = 4, meetings = [[3,1,3],[1,2,2],[0,3,3]], firstPerson = 3\nOutput:<\/strong> [0,1,3]\nExplanation:<\/strong>\nAt time 0, person 0 shares the secret with person 3.\nAt time 2, neither person 1 nor person 2 know the secret.\nAt time 3, person 3 shares the secret with person 0 and person 1.\nThus, people 0, 1, and 3 know the secret after all the meetings.\n<\/pre>\n\n\n\n
Example 3:<\/strong><\/p>\n\n\n\n
Input:<\/strong> n = 5, meetings = [[3,4,2],[1,2,1],[2,3,1]], firstPerson = 1\nOutput:<\/strong> [0,1,2,3,4]\nExplanation:<\/strong>\nAt time 0, person 0 shares the secret with person 1.\nAt time 1, person 1 shares the secret with person 2, and person 2 shares the secret with person 3.\nNote that person 2 can share the secret at the same time as receiving it.\nAt time 2, person 3 shares the secret with person 4.\nThus, people 0, 1, 2, 3, and 4 know the secret after all the meetings.\n<\/pre>\n\n\n\n
Example 4:<\/strong><\/p>\n\n\n\n
Input:<\/strong> n = 6, meetings = [[0,2,1],[1,3,1],[4,5,1]], firstPerson = 1\nOutput:<\/strong> [0,1,2,3]\nExplanation:<\/strong>\nAt time 0, person 0 shares the secret with person 1.\nAt time 1, person 0 shares the secret with person 2, and person 1 shares the secret with person 3.\nThus, people 0, 1, 2, and 3 know the secret after all the meetings.\n<\/pre>\n\n\n\n
Constraints:<\/strong><\/p>\n\n\n\n