## 524. Longest Word in Dictionary through Deleting

Given a string and a string dictionary, find the longest string in the dictionary that can be formed by deleting some characters of the given string. If there are more than one possible results, return the longest word with the smallest lexicographical order. If there is no possible result, return the empty string.

Example 1:

```Input:
s = "abpcplea", d = ["ale","apple","monkey","plea"]

Output:
"apple"
```

Example 2:

```Input:
s = "abpcplea", d = ["a","b","c"]

Output:
"a"
```

Note:

1. All the strings in the input will only contain lower-case letters.
2. The size of the dictionary won't exceed 1,000.
3. The length of all the strings in the input won't exceed 1,000.

## Rust Solution

``````struct Solution;

use std::cmp::Reverse;
use std::collections::BinaryHeap;

impl Solution {
fn find_longest_word(s: String, d: Vec<String>) -> String {
let s: Vec<char> = s.chars().collect();
let mut queue: BinaryHeap<(usize, Reverse<String>)> =
d.into_iter().map(|s| (s.len(), Reverse(s))).collect();
while let Some((_, r)) = queue.pop() {
let mut it = r.0.chars().peekable();
for i in 0..s.len() {
if let Some(&c) = it.peek() {
if c == s[i] {
it.next();
}
} else {
break;
}
}
if it.next().is_none() {
return r.0;
}
}
"".to_string()
}
}

#[test]
fn test() {
let s = "abpcplea".to_string();
let d = vec_string!["ale", "apple", "monkey", "plea"];
let res = "apple".to_string();
assert_eq!(Solution::find_longest_word(s, d), res);
let s = "abpcplea".to_string();
let d = vec_string!["a", "b", "c"];
let res = "a".to_string();
assert_eq!(Solution::find_longest_word(s, d), res);
}
``````

Having problems with this solution? Click here to submit an issue on github.