809. Expressive Words

https://leetcode.com/problems/expressive-words/description/

class Solution {
public:
    int expressiveWords(string S, vector<string>& words) {
        int res = ;
        for (const auto& w : words) {
            if (check(S, w))
                res++;
        }
        return res;
    }
    bool check(const string& s, const string& w) {
        int i = , j = , m = s.length(), n = w.length();
        while (i < m && j < n) {
            if (s[i] != w[j])   return false;
            int ii = , jj = ;
            while (++i < m && s[i] == s[i-]) ii++;
            while (++j < n && w[j] == w[j-]) jj++;
            if (ii < jj || ii <  && ii != jj)    return false;
        }
        return i == m && j == n;
    }
};