feat: add solutions to lc problem: No.2032

No.2032.Two Out of Three

Author: YangFong

solution/2000-2099/2032.Two Out of Three/README.md

@@ -141,6 +141,61 @@ func twoOutOfThree(nums1 []int, nums2 []int, nums3 []int) (ans []int) {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function twoOutOfThree(
+    nums1: number[],
+    nums2: number[],
+    nums3: number[],
+): number[] {
+    const count = new Array(101).fill(0);
+    new Set(nums1).forEach(v => count[v]++);
+    new Set(nums2).forEach(v => count[v]++);
+    new Set(nums3).forEach(v => count[v]++);
+    const ans = [];
+    count.forEach((v, i) => {
+        if (v >= 2) {
+            ans.push(i);
+        }
+    });
+    return ans;
+}
+```
+
+### **Rust**
+
+```rust
+use std::collections::HashSet;
+impl Solution {
+    pub fn two_out_of_three(nums1: Vec<i32>, nums2: Vec<i32>, nums3: Vec<i32>) -> Vec<i32> {
+        let mut count = vec![0; 101];
+        nums1
+            .into_iter()
+            .collect::<HashSet<i32>>()
+            .iter()
+            .for_each(|&v| count[v as usize] += 1);
+        nums2
+            .into_iter()
+            .collect::<HashSet<i32>>()
+            .iter()
+            .for_each(|&v| count[v as usize] += 1);
+        nums3
+            .into_iter()
+            .collect::<HashSet<i32>>()
+            .iter()
+            .for_each(|&v| count[v as usize] += 1);
+        let mut ans = Vec::new();
+        count.iter().enumerate().for_each(|(i, v)| {
+            if *v >= 2 {
+                ans.push(i as i32);
+            }
+        });
+        ans
+    }
+}
+```
+
 ### **...**
 
 ```

solution/2000-2099/2032.Two Out of Three/README_EN.md

@@ -125,6 +125,61 @@ func twoOutOfThree(nums1 []int, nums2 []int, nums3 []int) (ans []int) {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function twoOutOfThree(
+    nums1: number[],
+    nums2: number[],
+    nums3: number[],
+): number[] {
+    const count = new Array(101).fill(0);
+    new Set(nums1).forEach(v => count[v]++);
+    new Set(nums2).forEach(v => count[v]++);
+    new Set(nums3).forEach(v => count[v]++);
+    const ans = [];
+    count.forEach((v, i) => {
+        if (v >= 2) {
+            ans.push(i);
+        }
+    });
+    return ans;
+}
+```
+
+### **Rust**
+
+```rust
+use std::collections::HashSet;
+impl Solution {
+    pub fn two_out_of_three(nums1: Vec<i32>, nums2: Vec<i32>, nums3: Vec<i32>) -> Vec<i32> {
+        let mut count = vec![0; 101];
+        nums1
+            .into_iter()
+            .collect::<HashSet<i32>>()
+            .iter()
+            .for_each(|&v| count[v as usize] += 1);
+        nums2
+            .into_iter()
+            .collect::<HashSet<i32>>()
+            .iter()
+            .for_each(|&v| count[v as usize] += 1);
+        nums3
+            .into_iter()
+            .collect::<HashSet<i32>>()
+            .iter()
+            .for_each(|&v| count[v as usize] += 1);
+        let mut ans = Vec::new();
+        count.iter().enumerate().for_each(|(i, v)| {
+            if *v >= 2 {
+                ans.push(i as i32);
+            }
+        });
+        ans
+    }
+}
+```
+
 ### **...**
 
 ```

solution/2000-2099/2032.Two Out of Three/Solution.rs

@@ -0,0 +1,28 @@
+use std::collections::HashSet;
+impl Solution {
+    pub fn two_out_of_three(nums1: Vec<i32>, nums2: Vec<i32>, nums3: Vec<i32>) -> Vec<i32> {
+        let mut count = vec![0; 101];
+        nums1
+            .into_iter()
+            .collect::<HashSet<i32>>()
+            .iter()
+            .for_each(|&v| count[v as usize] += 1);
+        nums2
+            .into_iter()
+            .collect::<HashSet<i32>>()
+            .iter()
+            .for_each(|&v| count[v as usize] += 1);
+        nums3
+            .into_iter()
+            .collect::<HashSet<i32>>()
+            .iter()
+            .for_each(|&v| count[v as usize] += 1);
+        let mut ans = Vec::new();
+        count.iter().enumerate().for_each(|(i, v)| {
+            if *v >= 2 {
+                ans.push(i as i32);
+            }
+        });
+        ans
+    }
+}

solution/2000-2099/2032.Two Out of Three/Solution.ts

@@ -0,0 +1,17 @@
+function twoOutOfThree(
+    nums1: number[],
+    nums2: number[],
+    nums3: number[],
+): number[] {
+    const count = new Array(101).fill(0);
+    new Set(nums1).forEach(v => count[v]++);
+    new Set(nums2).forEach(v => count[v]++);
+    new Set(nums3).forEach(v => count[v]++);
+    const ans = [];
+    count.forEach((v, i) => {
+        if (v >= 2) {
+            ans.push(i);
+        }
+    });
+    return ans;
+}