332. Reconstruct Itinerary - LeetCode Solution


Depth-first Search Graph

Python Code:

class Solution:
    def findItinerary(self, tickets: List[List[str]]) -> List[str]:
        def d(c):
            while(len(g[c]) > 0):
                d(g[c].pop(0))
            r.insert(0, c) 
            
        g = collections.defaultdict(list)
        for u, v in (tickets):
            
            g[u].append(v)
            
            g[u].sort()
            
        r=[]      
        
        d("JFK")
        
        return r
        


Comments

Submit
0 Comments
More Questions

127. Word Ladder
123. Best Time to Buy and Sell Stock III
85. Maximal Rectangle
84. Largest Rectangle in Histogram
60. Permutation Sequence
42. Trapping Rain Water
32. Longest Valid Parentheses
Cutting a material
Bubble Sort
Number of triangles
AND path in a binary tree
Factorial equations
Removal of vertices
Happy segments
Cyclic shifts
Zoos
Build a graph
Almost correct bracket sequence
Count of integers
Differences of the permutations
Doctor's Secret
Back to School
I am Easy
Teddy and Tweety
Partitioning binary strings
Special sets
Smallest chosen word
Going to office
Color the boxes
Missing numbers