solve problem All Paths From Source To Target

Author: P-ppc

README.md

@@ -303,6 +303,7 @@ All solutions will be accepted!
 |896|[Monotonic Array](https://leetcode-cn.com/problems/monotonic-array/description/)|[java/py/js](./algorithms/MonotonicArray)|Easy|
 |739|[Daily Temperatures](https://leetcode-cn.com/problems/daily-temperatures/description/)|[java/py/js](./algorithms/DailyTemperatures)|Medium|
 |921|[Minimum Add To Make Parentheses Valid](https://leetcode-cn.com/problems/minimum-add-to-make-parentheses-valid/description/)|[java/py/js](./algorithms/MinimumAddToMakeParenthesesValid)|Medium|
+|797|[All Paths From Source To Target](https://leetcode-cn.com/problems/all-paths-from-source-to-target/description/)|[java/py/js](./algorithms/AllPathsFromSourceToTarget)|Medium|
 
 # Database
 |#|Title|Solution|Difficulty|

algorithms/AllPathsFromSourceToTarget/README.md

@@ -0,0 +1,2 @@
+# All Paths From Source To Target
+We can solve this problem by Backtracking Algorithm

algorithms/AllPathsFromSourceToTarget/Solution.java

@@ -0,0 +1,18 @@
+class Solution {
+    public List<List<Integer>> allPathsSourceTarget(int[][] graph) {
+        List<List<Integer>> res = new ArrayList<List<Integer>>();
+        if (graph.length > 0)
+            backTrack(graph, 0, new ArrayList<Integer>(), res);
+        return res;
+    }
+    
+    public void backTrack(int[][] graph, int i, List<Integer> temp, List<List<Integer>> res) {
+        temp.add(i);
+        if (i == graph.length - 1)
+            res.add(temp);
+        else {
+            for (int v : graph[i])
+                backTrack(graph, v, new ArrayList<Integer>(temp), res);
+        }
+    }
+}

algorithms/AllPathsFromSourceToTarget/solution.js

@@ -0,0 +1,18 @@
+/**
+ * @param {number[][]} graph
+ * @return {number[][]}
+ */
+var allPathsSourceTarget = function(graph) {
+    let res = []
+    if (graph.length > 0)
+        backTrack(graph, 0, [], res)
+    return res
+};
+
+var backTrack = function (graph, i, temp, res) {
+    temp.push(i)
+    if (i == graph.length - 1)
+        res.push(temp)
+    else
+        graph[i].forEach(v => backTrack(graph, v, temp.slice(), res))
+}

algorithms/AllPathsFromSourceToTarget/solution.py

@@ -0,0 +1,19 @@
+class Solution(object):
+    def allPathsSourceTarget(self, graph):
+        """
+        :type graph: List[List[int]]
+        :rtype: List[List[int]]
+        """
+        res = []
+        if len(graph) > 0:
+            self.backtrack(graph, 0, [], res)
+        return res
+        
+    
+    def backtrack(self, graph, i, temp, res):
+        temp.append(i)
+        if i == len(graph) - 1:
+            res.append(temp)
+        else:
+            for v in graph[i]:
+                self.backtrack(graph, v, temp[:], res)