Intersection of Multiple Arrays LeetCode solution in Rust

1
use std::collections::HashMap;
2

3
impl Solution {
4
  pub fn intersection(nums: Vec<Vec<i32>>) -> Vec<i32> {
5
    let mut map = HashMap::new();
6
    let mut res = vec![];
7
    for i in 0..nums.len() {
8
      for j in 0..nums[i].len() {
9
        *map.entry(nums[i][j]).or_insert(0) += 1;
10
      }
11
    }
12
    for (key, value) in &map {
13
      if *value == nums.len() {
14
        res.push(*key);
15
      }
16
    }
17
    res.sort();
18
    res
19
  }
20
}