feat: add solutions to lc problem: No.1704

No.1704.Determine if String Halves Are Alike

Author: YangFong

solution/1700-1799/1704.Determine if String Halves Are Alike/README.md

@@ -133,6 +133,46 @@ func halvesAreAlike(s string) bool {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function halvesAreAlike(s: string): boolean {
+    const set = new Set(['a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U']);
+    const n = s.length >> 1;
+    let count = 0;
+    for (let i = 0; i < n; i++) {
+        set.has(s[i]) && count++;
+        set.has(s[n + i]) && count--;
+    }
+    return count === 0;
+}
+```
+
+### **Rust**
+
+```rust
+use std::collections::HashSet;
+impl Solution {
+    pub fn halves_are_alike(s: String) -> bool {
+        let set: HashSet<&u8> = [b'a', b'e', b'i', b'o', b'u', b'A', b'E', b'I', b'O', b'U']
+            .into_iter()
+            .collect();
+        let s = s.as_bytes();
+        let n = s.len() >> 1;
+        let mut count = 0;
+        for i in 0..n {
+            if set.contains(&s[i]) {
+                count += 1;
+            }
+            if set.contains(&s[n + i]) {
+                count -= 1;
+            }
+        }
+        count == 0
+    }
+}
+```
+
 ### **...**
 
 ```

solution/1700-1799/1704.Determine if String Halves Are Alike/README_EN.md

@@ -117,6 +117,46 @@ func halvesAreAlike(s string) bool {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function halvesAreAlike(s: string): boolean {
+    const set = new Set(['a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U']);
+    const n = s.length >> 1;
+    let count = 0;
+    for (let i = 0; i < n; i++) {
+        set.has(s[i]) && count++;
+        set.has(s[n + i]) && count--;
+    }
+    return count === 0;
+}
+```
+
+### **Rust**
+
+```rust
+use std::collections::HashSet;
+impl Solution {
+    pub fn halves_are_alike(s: String) -> bool {
+        let set: HashSet<&u8> = [b'a', b'e', b'i', b'o', b'u', b'A', b'E', b'I', b'O', b'U']
+            .into_iter()
+            .collect();
+        let s = s.as_bytes();
+        let n = s.len() >> 1;
+        let mut count = 0;
+        for i in 0..n {
+            if set.contains(&s[i]) {
+                count += 1;
+            }
+            if set.contains(&s[n + i]) {
+                count -= 1;
+            }
+        }
+        count == 0
+    }
+}
+```
+
 ### **...**
 
 ```

solution/1700-1799/1704.Determine if String Halves Are Alike/Solution.rs

@@ -0,0 +1,20 @@
+use std::collections::HashSet;
+impl Solution {
+    pub fn halves_are_alike(s: String) -> bool {
+        let set: HashSet<&u8> = [b'a', b'e', b'i', b'o', b'u', b'A', b'E', b'I', b'O', b'U']
+            .into_iter()
+            .collect();
+        let s = s.as_bytes();
+        let n = s.len() >> 1;
+        let mut count = 0;
+        for i in 0..n {
+            if set.contains(&s[i]) {
+                count += 1;
+            }
+            if set.contains(&s[n + i]) {
+                count -= 1;
+            }
+        }
+        count == 0
+    }
+}

solution/1700-1799/1704.Determine if String Halves Are Alike/Solution.ts

@@ -0,0 +1,10 @@
+function halvesAreAlike(s: string): boolean {
+    const set = new Set(['a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U']);
+    const n = s.length >> 1;
+    let count = 0;
+    for (let i = 0; i < n; i++) {
+        set.has(s[i]) && count++;
+        set.has(s[n + i]) && count--;
+    }
+    return count === 0;
+}