feat: add solutions to lc problems: No.0524

No.0524.Longest Word in Dictionary through Deleting

Author: YangFong

Diff for: solution/0500-0599/0524.Longest Word in Dictionary through Deleting/README.md

@@ -59,6 +59,65 @@
 
 ```
 
+### **TypeScript**
+
+```ts
+function findLongestWord(s: string, dictionary: string[]): string {
+    dictionary.sort((a, b) => {
+        if (a.length === b.length) {
+            return b < a ? 1 : -1;
+        }
+        return b.length - a.length;
+    });
+    const n = s.length;
+    for (const target of dictionary) {
+        const m = target.length;
+        if (m > n) {
+            continue;
+        }
+        let i = 0;
+        let j = 0;
+        while (i < n && j < m) {
+            if (s[i] === target[j]) {
+                j++;
+            }
+            i++;
+        }
+        if (j === m) {
+            return target;
+        }
+    }
+    return '';
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn find_longest_word(s: String, mut dictionary: Vec<String>) -> String {
+        dictionary.sort_unstable_by(|a, b| (b.len(), a).cmp(&(a.len(), b)));
+        for target in dictionary {
+            let target: Vec<char> = target.chars().collect();
+            let n = target.len();
+            let mut i = 0;
+            for c in s.chars() {
+                if i == n {
+                    break;
+                }
+                if c == target[i] {
+                    i += 1;
+                }
+            }
+            if i == n {
+                return target.iter().collect();
+            }
+        }
+        String::new()
+    }
+}
+```
+
 ### **...**
 
 ```

Diff for: solution/0500-0599/0524.Longest Word in Dictionary through Deleting/README_EN.md

@@ -47,6 +47,65 @@
 
 ```
 
+### **TypeScript**
+
+```ts
+function findLongestWord(s: string, dictionary: string[]): string {
+    dictionary.sort((a, b) => {
+        if (a.length === b.length) {
+            return b < a ? 1 : -1;
+        }
+        return b.length - a.length;
+    });
+    const n = s.length;
+    for (const target of dictionary) {
+        const m = target.length;
+        if (m > n) {
+            continue;
+        }
+        let i = 0;
+        let j = 0;
+        while (i < n && j < m) {
+            if (s[i] === target[j]) {
+                j++;
+            }
+            i++;
+        }
+        if (j === m) {
+            return target;
+        }
+    }
+    return '';
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn find_longest_word(s: String, mut dictionary: Vec<String>) -> String {
+        dictionary.sort_unstable_by(|a, b| (b.len(), a).cmp(&(a.len(), b)));
+        for target in dictionary {
+            let target: Vec<char> = target.chars().collect();
+            let n = target.len();
+            let mut i = 0;
+            for c in s.chars() {
+                if i == n {
+                    break;
+                }
+                if c == target[i] {
+                    i += 1;
+                }
+            }
+            if i == n {
+                return target.iter().collect();
+            }
+        }
+        String::new()
+    }
+}
+```
+
 ### **...**
 
 ```

Diff for: solution/0500-0599/0524.Longest Word in Dictionary through Deleting/Solution.rs

@@ -0,0 +1,22 @@
+impl Solution {
+    pub fn find_longest_word(s: String, mut dictionary: Vec<String>) -> String {
+        dictionary.sort_unstable_by(|a, b| (b.len(), a).cmp(&(a.len(), b)));
+        for target in dictionary {
+            let target: Vec<char> = target.chars().collect();
+            let n = target.len();
+            let mut i = 0;
+            for c in s.chars() {
+                if i == n {
+                    break;
+                }
+                if c == target[i] {
+                    i += 1;
+                }
+            }
+            if i == n {
+                return target.iter().collect();
+            }
+        }
+        String::new()
+    }
+}

Diff for: solution/0500-0599/0524.Longest Word in Dictionary through Deleting/Solution.ts

@@ -0,0 +1,27 @@
+function findLongestWord(s: string, dictionary: string[]): string {
+    dictionary.sort((a, b) => {
+        if (a.length === b.length) {
+            return b < a ? 1 : -1;
+        }
+        return b.length - a.length;
+    });
+    const n = s.length;
+    for (const target of dictionary) {
+        const m = target.length;
+        if (m > n) {
+            continue;
+        }
+        let i = 0;
+        let j = 0;
+        while (i < n && j < m) {
+            if (s[i] === target[j]) {
+                j++;
+            }
+            i++;
+        }
+        if (j === m) {
+            return target;
+        }
+    }
+    return '';
+}