leetcode

0 class Solution {

1 public:

2 int minSteps(const string &s, const string &t) {

3 int count[27] = {0}, res = 0;

4 for (const char c : s)

5 count[c & 0x1F]++;

6 for (const char c : t)

7 count[c & 0x1F]--;

8 for (int i = 1; i <= 26; i++)

9 res += abs(count[i]);

10 return res;

11 }

12 };