feat: add ts solution to lc problem: No.1129 (#2989)

Author: rain84

solution/1100-1199/1129.Shortest Path with Alternating Colors/README.md

@@ -246,6 +246,54 @@ func shortestAlternatingPaths(n int, redEdges [][]int, blueEdges [][]int) []int
 }
 ```
 
+#### TypeScript
+
+```ts
+function shortestAlternatingPaths(
+    n: number,
+    redEdges: number[][],
+    blueEdges: number[][],
+): number[] {
+    const g: [Graph, Graph] = [{}, {}];
+    const ans = Array(n).fill(-1);
+    const vis = Array.from({ length: n }, () => Array.from({ length: 2 }, () => false));
+    let q: Vertex[] = [
+        [0, 0],
+        [0, 1],
+    ];
+    vis[0][0] = vis[0][1] = true;
+    let d = 0;
+    for (const [i, j] of redEdges) {
+        (g[0][i] ??= []).push(j);
+    }
+    for (const [i, j] of blueEdges) {
+        (g[1][i] ??= []).push(j);
+    }
+    while (q.length) {
+        const qNext: Vertex[] = [];
+        for (let [i, color] of q) {
+            if (ans[i] === -1) {
+                ans[i] = d;
+            }
+            color ^= 1;
+            for (const j of g[color][i] ?? []) {
+                if (!vis[j][color]) {
+                    vis[j][color] = true;
+                    qNext.push([j, color as Color]);
+                }
+            }
+        }
+        q = qNext;
+        d++;
+    }
+    return ans;
+}
+
+type Graph = Record<number, number[]>;
+type Color = 0 | 1;
+type Vertex = [number, Color];
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/1100-1199/1129.Shortest Path with Alternating Colors/README_EN.md

@@ -244,6 +244,54 @@ func shortestAlternatingPaths(n int, redEdges [][]int, blueEdges [][]int) []int
 }
 ```
 
+#### TypeScript
+
+```ts
+function shortestAlternatingPaths(
+    n: number,
+    redEdges: number[][],
+    blueEdges: number[][],
+): number[] {
+    const g: [Graph, Graph] = [{}, {}];
+    const ans = Array(n).fill(-1);
+    const vis = Array.from({ length: n }, () => Array.from({ length: 2 }, () => false));
+    let q: Vertex[] = [
+        [0, 0],
+        [0, 1],
+    ];
+    vis[0][0] = vis[0][1] = true;
+    let d = 0;
+    for (const [i, j] of redEdges) {
+        (g[0][i] ??= []).push(j);
+    }
+    for (const [i, j] of blueEdges) {
+        (g[1][i] ??= []).push(j);
+    }
+    while (q.length) {
+        const qNext: Vertex[] = [];
+        for (let [i, color] of q) {
+            if (ans[i] === -1) {
+                ans[i] = d;
+            }
+            color ^= 1;
+            for (const j of g[color][i] ?? []) {
+                if (!vis[j][color]) {
+                    vis[j][color] = true;
+                    qNext.push([j, color as Color]);
+                }
+            }
+        }
+        q = qNext;
+        d++;
+    }
+    return ans;
+}
+
+type Graph = Record<number, number[]>;
+type Color = 0 | 1;
+type Vertex = [number, Color];
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/1100-1199/1129.Shortest Path with Alternating Colors/Solution.ts

@@ -0,0 +1,43 @@
+function shortestAlternatingPaths(
+    n: number,
+    redEdges: number[][],
+    blueEdges: number[][],
+): number[] {
+    const g: [Graph, Graph] = [{}, {}];
+    const ans = Array(n).fill(-1);
+    const vis = Array.from({ length: n }, () => Array.from({ length: 2 }, () => false));
+    let q: Vertex[] = [
+        [0, 0],
+        [0, 1],
+    ];
+    vis[0][0] = vis[0][1] = true;
+    let d = 0;
+    for (const [i, j] of redEdges) {
+        (g[0][i] ??= []).push(j);
+    }
+    for (const [i, j] of blueEdges) {
+        (g[1][i] ??= []).push(j);
+    }
+    while (q.length) {
+        const qNext: Vertex[] = [];
+        for (let [i, color] of q) {
+            if (ans[i] === -1) {
+                ans[i] = d;
+            }
+            color ^= 1;
+            for (const j of g[color][i] ?? []) {
+                if (!vis[j][color]) {
+                    vis[j][color] = true;
+                    qNext.push([j, color as Color]);
+                }
+            }
+        }
+        q = qNext;
+        d++;
+    }
+    return ans;
+}
+
+type Graph = Record<number, number[]>;
+type Color = 0 | 1;
+type Vertex = [number, Color];