Maximum Product of Word Lengths LeetCode solution in Rust

1
impl Solution {
2
  pub fn max_product(words: Vec<String>) -> i32 {
3
    let v = words
4
      .iter()
5
      .map(|word| {
6
        word
7
          .as_bytes()
8
          .iter()
9
          .fold(0_u32, |acc, x| acc | 1 << (x - b'a'))
10
      })
11
      .collect::<Vec<_>>();
12
    let mut answer = 0;
13
    for i in 0..words.len() - 1 {
14
      for j in i + 1..words.len() {
15
        if v[i] & v[j] == 0 {
16
          answer = answer.max(words[i].len() * words[j].len())
17
        }
18
      }
19
    }
20
    answer as i32
21
  }
22
}