no message

Author: Chris Wu

problems/accounts-merge.py

@@ -16,7 +16,7 @@ def accountsMerge(self, accounts):
         for data in accounts:
             name = data[0]
             visited = set()
-            stack = [data[1]]
+            stack = [data[1]] #[2]
 
             if data[1] in merged: continue #[1]
 
@@ -27,7 +27,7 @@ def accountsMerge(self, accounts):
                 stack.extend(graph[e])
 
             merged.update(visited)
-            ans.append([name]+sorted(list(visited)))
+            ans.append([name]+sorted(list(visited))) #[3]
 
         return ans
 
@@ -40,8 +40,8 @@ def accountsMerge(self, accounts):
 If the first email is already merged to other groups, then other emails will be in another group as well.
 So don't need to check.
 
-Second, do a DFS starting from the first email. Put all the connected nodes into visited.
-And append it to the ans with name.
+Second, do a DFS starting from the first email. Put all the connected nodes into visited. [2]
+And append the sorted(visited) to the ans with name. [3]
 
 Let N be the total number of emails. M be the total number of final groups.
 Build the graph takes O(N).