Update longest-path-with-different-adjacent-characters.py

Author: kamyu104

Python/longest-path-with-different-adjacent-characters.py

@@ -12,9 +12,10 @@ def longestPath(self, parent, s):
         :type s: str
         :rtype: int
         """
-        def topological_sort(adj, q):
-            top2 = collections.defaultdict(lambda:[0]*2)
+        def topological_sort(s, adj, in_degree):
             result = 1
+            top2 = collections.defaultdict(lambda:[0]*2)
+            q =  [(i, 1) for i, d in enumerate(in_degree) if not d]
             while q:
                 new_q = []
                 for (u, l) in q:
@@ -38,7 +39,7 @@ def topological_sort(adj, q):
         for i in xrange(1, len(parent)):
             adj[i].append(parent[i])
             in_degree[parent[i]] += 1
-        return topological_sort(adj, [(i, 1) for i, d in enumerate(in_degree) if not d])
+        return topological_sort(s, adj, in_degree)
 
 
 # Time:  O(n)