[99클럽] 13일차 TIL

leetcode에서 그래프문제를 풀어보았습니다.

 

아직도 leetcode 문제풀이는 너무 어렵습니다..

 

https://leetcode.com/problems/all-paths-from-source-to-target/description/

 

 

class Solution:
    def __init__(self):
        self.paths = []
        self.graph = {}
        
    def buildGraph(self, graph):
        for i, neighbors in enumerate(graph):
            self.graph[i] = neighbors

    def setPaths(self, src, dest, path):
        if src == dest:
            self.paths.append(path)
            return
        
        for neighbor in self.graph[src]:
            self.setPaths(neighbor, dest, path + [neighbor])
                          
            
    def allPathsSourceTarget(self, graph: List[List[int]]) -> List[List[int]]:
        
        self.buildGraph(graph)
        self.setPaths(0, len(graph)-1, [0])
        
        return self.paths