feat: add solutions to lc problem: No.0841

No.0841.Keys and Rooms

Author: YangFong

solution/0800-0899/0841.Keys and Rooms/README.md

@@ -149,6 +149,62 @@ func canVisitAllRooms(rooms [][]int) bool {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function canVisitAllRooms(rooms: number[][]): boolean {
+    const n = rooms.length;
+    const isOpen = new Array(n).fill(false);
+    const dfs = (i: number) => {
+        if (isOpen[i]) {
+            return;
+        }
+        isOpen[i] = true;
+        rooms[i].forEach(k => dfs(k));
+    };
+    dfs(0);
+    return isOpen.every(v => v);
+}
+```
+
+```ts
+function canVisitAllRooms(rooms: number[][]): boolean {
+    const n = rooms.length;
+    const isOpen = new Array(n).fill(false);
+    const keys = [0];
+    while (keys.length !== 0) {
+        const i = keys.pop();
+        if (isOpen[i]) {
+            continue;
+        }
+        isOpen[i] = true;
+        keys.push(...rooms[i]);
+    }
+    return isOpen.every(v => v);
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn can_visit_all_rooms(rooms: Vec<Vec<i32>>) -> bool {
+        let n = rooms.len();
+        let mut is_open = vec![false; n];
+        let mut keys = vec![0];
+        while !keys.is_empty() {
+            let i = keys.pop().unwrap();
+            if is_open[i] {
+                continue;
+            }
+            is_open[i] = true;
+            rooms[i].iter().for_each(|&key| keys.push(key as usize));
+        }
+        is_open.iter().all(|&v| v)
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0800-0899/0841.Keys and Rooms/README_EN.md

@@ -136,6 +136,62 @@ func canVisitAllRooms(rooms [][]int) bool {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function canVisitAllRooms(rooms: number[][]): boolean {
+    const n = rooms.length;
+    const isOpen = new Array(n).fill(false);
+    const dfs = (i: number) => {
+        if (isOpen[i]) {
+            return;
+        }
+        isOpen[i] = true;
+        rooms[i].forEach(k => dfs(k));
+    };
+    dfs(0);
+    return isOpen.every(v => v);
+}
+```
+
+```ts
+function canVisitAllRooms(rooms: number[][]): boolean {
+    const n = rooms.length;
+    const isOpen = new Array(n).fill(false);
+    const keys = [0];
+    while (keys.length !== 0) {
+        const i = keys.pop();
+        if (isOpen[i]) {
+            continue;
+        }
+        isOpen[i] = true;
+        keys.push(...rooms[i]);
+    }
+    return isOpen.every(v => v);
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn can_visit_all_rooms(rooms: Vec<Vec<i32>>) -> bool {
+        let n = rooms.len();
+        let mut is_open = vec![false; n];
+        let mut keys = vec![0];
+        while !keys.is_empty() {
+            let i = keys.pop().unwrap();
+            if is_open[i] {
+                continue;
+            }
+            is_open[i] = true;
+            rooms[i].iter().for_each(|&key| keys.push(key as usize));
+        }
+        is_open.iter().all(|&v| v)
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0800-0899/0841.Keys and Rooms/Solution.rs

@@ -0,0 +1,16 @@
+impl Solution {
+    pub fn can_visit_all_rooms(rooms: Vec<Vec<i32>>) -> bool {
+        let n = rooms.len();
+        let mut is_open = vec![false; n];
+        let mut keys = vec![0];
+        while !keys.is_empty() {
+            let i = keys.pop().unwrap();
+            if is_open[i] {
+                continue;
+            }
+            is_open[i] = true;
+            rooms[i].iter().for_each(|&key| keys.push(key as usize));
+        }
+        is_open.iter().all(|&v| v)
+    }
+}

solution/0800-0899/0841.Keys and Rooms/Solution.ts

@@ -0,0 +1,14 @@
+function canVisitAllRooms(rooms: number[][]): boolean {
+    const n = rooms.length;
+    const isOpen = new Array(n).fill(false);
+    const keys = [0];
+    while (keys.length !== 0) {
+        const i = keys.pop();
+        if (isOpen[i]) {
+            continue;
+        }
+        isOpen[i] = true;
+        keys.push(...rooms[i]);
+    }
+    return isOpen.every(v => v);
+}