Minimum Number of Steps to Make Two Strings Anagram LeetCode solution in C++

1
class Solution {
2
 public:
3
  int minSteps(string s, string t) {
4
    int count = 0, length = s.length();
5
    vector<int> vec1(26, 0), vec2(26, 0);
6
    for (int i = 0; i < length; ++i) {
7
      vec1[s[i] - 'a']++;
8
      vec2[t[i] - 'a']++;
9
    }
10
    for (int i = 0; i < 26; ++i) {
11
      if (vec1[i] > vec2[i]) count += vec1[i] - vec2[i];
12
    }
13
    return count;
14
  }
15
};