works/solutions/leetcode/cpp/1347.cpp


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35

#include <string>

using std::string;

class Solution
{
public:
    int minSteps(string s, string t)
    {
        int s_count[26]{0};
        int t_count[26]{0};

        for (auto c : s)
        {
            s_count[c - 'a']++;
        }

        for (auto c : t)
        {
            t_count[c - 'a']++;
        }

        int result = 0;

        for (int i = 0; i < 26; i++)
        {
            int a = s_count[i];
            int b = t_count[i];
            if (a > b)
                result += a - b;
        }

        return result;
    }
};