leetcode

0 class Solution {

1 public:

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

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

4 for (int i = 0; i < s.size(); i++) {

5 count[s[i] & 0x1F]++;

6 count[t[i] & 0x1F]--;

7 }

8 for (int i = 1; i < 27; i++) {

9 if (count[i] > 0) res += count[i];

10 }

11 return res;

12 }

13 };