Minimum Number of Steps to Make Two Strings Anagram II LeetCode solution in Rust

1
impl Solution {
2
  pub fn min_steps(s: String, t: String) -> i32 {
3
    let mut counter1: [i32; 26] = [0; 26];
4
    let mut counter2: [i32; 26] = [0; 26];
5
    for c in s.as_bytes() {
6
      counter1[(*c as usize) - 97] += 1;
7
    }
8
    for c in t.as_bytes() {
9
      counter2[(*c as usize) - 97] += 1;
10
    }
11

12
    (0..26)
13
      .map(|i| (counter1[i] - counter2[i]).abs())
14
      .sum::<i32>()
15
  }
16
}