2186_MinimumNumberofStepstoMakeTwoStringsAnagramII - a920604a/leetcode GitHub Wiki

class Solution {
public:
    int minSteps(string s, string t) {
        // beacuse only have lowercase English 
        vector<int> ret(26,0);
        for(char c:s) ret[c-'a']++;
        for(char c:t) ret[c-'a']--;
        int count = 0;
        for(int r:ret) count+=(abs(r));
        return count;
    }
};