feat: add solutions to lc problem: No.0886

No.0886.Possible Bipartition

Author: YangFong

solution/0800-0899/0886.Possible Bipartition/README.md

@@ -251,6 +251,67 @@ func possibleBipartition(n int, dislikes [][]int) bool {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function possibleBipartition(n: number, dislikes: number[][]): boolean {
+    const color = new Array(n + 1).fill(0);
+    const g = Array.from({ length: n + 1 }, () => []);
+    const dfs = (i: number, v: number) => {
+        color[i] = v;
+        for (const j of g[i]) {
+            if (color[j] === color[i] || (color[j] === 0 && dfs(j, 3 ^ v))) {
+                return true;
+            }
+        }
+        return false;
+    };
+    for (const [a, b] of dislikes) {
+        g[a].push(b);
+        g[b].push(a);
+    }
+    for (let i = 1; i <= n; i++) {
+        if (color[i] === 0 && dfs(i, 1)) {
+            return false;
+        }
+    }
+    return true;
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    fn dfs(i: usize, v: usize, color: &mut Vec<usize>, g: &Vec<Vec<usize>>) -> bool {
+        color[i] = v;
+        for &j in (*g[i]).iter() {
+            if color[j] == color[i] || color[j] == 0 && Self::dfs(j, v ^ 3, color, g) {
+                return true;
+            }
+        }
+        false
+    }
+
+    pub fn possible_bipartition(n: i32, dislikes: Vec<Vec<i32>>) -> bool {
+        let n = n as usize;
+        let mut color = vec![0; n + 1];
+        let mut g = vec![Vec::new(); n + 1];
+        for d in dislikes.iter() {
+            let (i, j) = (d[0] as usize, d[1] as usize);
+            g[i].push(j);
+            g[j].push(i);
+        }
+        for i in 1..=n {
+            if color[i] == 0 && Self::dfs(i, 1, &mut color, &g) {
+                return false;
+            }
+        }
+        true
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0800-0899/0886.Possible Bipartition/README_EN.md

@@ -178,6 +178,67 @@ func possibleBipartition(n int, dislikes [][]int) bool {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function possibleBipartition(n: number, dislikes: number[][]): boolean {
+    const color = new Array(n + 1).fill(0);
+    const g = Array.from({ length: n + 1 }, () => []);
+    const dfs = (i: number, v: number) => {
+        color[i] = v;
+        for (const j of g[i]) {
+            if (color[j] === color[i] || (color[j] === 0 && dfs(j, 3 ^ v))) {
+                return true;
+            }
+        }
+        return false;
+    };
+    for (const [a, b] of dislikes) {
+        g[a].push(b);
+        g[b].push(a);
+    }
+    for (let i = 1; i <= n; i++) {
+        if (color[i] === 0 && dfs(i, 1)) {
+            return false;
+        }
+    }
+    return true;
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    fn dfs(i: usize, v: usize, color: &mut Vec<usize>, g: &Vec<Vec<usize>>) -> bool {
+        color[i] = v;
+        for &j in (*g[i]).iter() {
+            if color[j] == color[i] || color[j] == 0 && Self::dfs(j, v ^ 3, color, g) {
+                return true;
+            }
+        }
+        false
+    }
+
+    pub fn possible_bipartition(n: i32, dislikes: Vec<Vec<i32>>) -> bool {
+        let n = n as usize;
+        let mut color = vec![0; n + 1];
+        let mut g = vec![Vec::new(); n + 1];
+        for d in dislikes.iter() {
+            let (i, j) = (d[0] as usize, d[1] as usize);
+            g[i].push(j);
+            g[j].push(i);
+        }
+        for i in 1..=n {
+            if color[i] == 0 && Self::dfs(i, 1, &mut color, &g) {
+                return false;
+            }
+        }
+        true
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0800-0899/0886.Possible Bipartition/Solution.rs

@@ -0,0 +1,28 @@
+impl Solution {
+    fn dfs(i: usize, v: usize, color: &mut Vec<usize>, g: &Vec<Vec<usize>>) -> bool {
+        color[i] = v;
+        for &j in (*g[i]).iter() {
+            if color[j] == color[i] || color[j] == 0 && Self::dfs(j, v ^ 3, color, g) {
+                return true;
+            }
+        }
+        false
+    }
+
+    pub fn possible_bipartition(n: i32, dislikes: Vec<Vec<i32>>) -> bool {
+        let n = n as usize;
+        let mut color = vec![0; n + 1];
+        let mut g = vec![Vec::new(); n + 1];
+        for d in dislikes.iter() {
+            let (i, j) = (d[0] as usize, d[1] as usize);
+            g[i].push(j);
+            g[j].push(i);
+        }
+        for i in 1..=n {
+            if color[i] == 0 && Self::dfs(i, 1, &mut color, &g) {
+                return false;
+            }
+        }
+        true
+    }
+}

solution/0800-0899/0886.Possible Bipartition/Solution.ts

@@ -0,0 +1,23 @@
+function possibleBipartition(n: number, dislikes: number[][]): boolean {
+    const color = new Array(n + 1).fill(0);
+    const g = Array.from({ length: n + 1 }, () => []);
+    const dfs = (i: number, v: number) => {
+        color[i] = v;
+        for (const j of g[i]) {
+            if (color[j] === color[i] || (color[j] === 0 && dfs(j, 3 ^ v))) {
+                return true;
+            }
+        }
+        return false;
+    };
+    for (const [a, b] of dislikes) {
+        g[a].push(b);
+        g[b].push(a);
+    }
+    for (let i = 1; i <= n; i++) {
+        if (color[i] === 0 && dfs(i, 1)) {
+            return false;
+        }
+    }
+    return true;
+}