package leetcode;

import java.util.List;

/**
 * https://leetcode.com/problems/all-paths-from-source-to-target/
 */
public class Problem797 {
    public List<List<Integer>> allPathsSourceTarget(int[][] graph) {
        // TODO
        return null;
    }

    public static void main(String[] args) {
        Problem797 prob = new Problem797();
        System.out.println(prob.allPathsSourceTarget(new int[][]{
            {1, 2}, {3}, {3}, {}
        })); // [[0,1,3],[0,2,3]]
    }
}

@@ -31,18 +31,71 @@
 .util.Li
-st
+nkedList;%0Aimport java.util.List;%0Aimport java.util.Queue
 ;%0A%0A/**%0A 
@@ -274,16 +274,113 @@
 // TODO%0A
+        Queue%3CInteger%3E queue = new LinkedList%3C%3E();%0A        while (!queue.isEmpty()) %7B%0A%0A        %7D%0A
         

Update problem 797