feat: add ts solution to lc problem: No.0797

solution/0700-0799/0797.All Paths From Source to Target/README.md

@@ -223,6 +223,32 @@ var allPathsSourceTarget = function (graph) {
 };
 ```
 
+#### TypeScript
+
+```ts
+function allPathsSourceTarget(graph: number[][]): number[][] {
+    const ans: number[][] = [];
+
+    const dfs = (path: number[]) => {
+        const curr = path.at(-1)!;
+        if (curr === graph.length - 1) {
+            ans.push([...path]);
+            return;
+        }
+
+        for (const v of graph[curr]) {
+            path.push(v);
+            dfs(path);
+            path.pop();
+        }
+    };
+
+    dfs([0]);
+
+    return ans;
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0700-0799/0797.All Paths From Source to Target/README_EN.md

@@ -215,6 +215,32 @@ var allPathsSourceTarget = function (graph) {
 };
 ```
 
+#### TypeScript
+
+```ts
+function allPathsSourceTarget(graph: number[][]): number[][] {
+    const ans: number[][] = [];
+
+    const dfs = (path: number[]) => {
+        const curr = path.at(-1)!;
+        if (curr === graph.length - 1) {
+            ans.push([...path]);
+            return;
+        }
+
+        for (const v of graph[curr]) {
+            path.push(v);
+            dfs(path);
+            path.pop();
+        }
+    };
+
+    dfs([0]);
+
+    return ans;
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0700-0799/0797.All Paths From Source to Target/Solution.ts

@@ -0,0 +1,21 @@
+function allPathsSourceTarget(graph: number[][]): number[][] {
+    const ans: number[][] = [];
+
+    const dfs = (path: number[]) => {
+        const curr = path.at(-1)!;
+        if (curr === graph.length - 1) {
+            ans.push([...path]);
+            return;
+        }
+
+        for (const v of graph[curr]) {
+            path.push(v);
+            dfs(path);
+            path.pop();
+        }
+    };
+
+    dfs([0]);
+
+    return ans;
+}