<p>Given a <code>wordlist</code>, we want to implement a spellchecker that converts a query word into a correct word.</p>

<p>For a given <code>query</code> word, the spell checker handles two categories of spelling mistakes:</p>

<ul>
	<li>Capitalization: If the query matches a word in the wordlist (<strong>case-insensitive</strong>), then the query word is returned with the same case as the case in the wordlist.

	<ul>
		<li>Example: <code>wordlist = [&quot;yellow&quot;]</code>, <code>query = &quot;YellOw&quot;</code>: <code>correct = &quot;yellow&quot;</code></li>
		<li>Example: <code>wordlist = [&quot;Yellow&quot;]</code>, <code>query = &quot;yellow&quot;</code>: <code>correct = &quot;Yellow&quot;</code></li>
		<li>Example: <code>wordlist = [&quot;yellow&quot;]</code>, <code>query = &quot;yellow&quot;</code>: <code>correct = &quot;yellow&quot;</code></li>
	</ul>
	</li>
	<li>Vowel Errors: If after replacing the vowels <code>(&#39;a&#39;, &#39;e&#39;, &#39;i&#39;, &#39;o&#39;, &#39;u&#39;)</code> of the query word with any vowel individually, it matches a word in the wordlist (<strong>case-insensitive</strong>), then the query word is returned with the same case as the match in the wordlist.
	<ul>
		<li>Example: <code>wordlist = [&quot;YellOw&quot;]</code>, <code>query = &quot;yollow&quot;</code>: <code>correct = &quot;YellOw&quot;</code></li>
		<li>Example: <code>wordlist = [&quot;YellOw&quot;]</code>, <code>query = &quot;yeellow&quot;</code>: <code>correct = &quot;&quot;</code> (no match)</li>
		<li>Example: <code>wordlist = [&quot;YellOw&quot;]</code>, <code>query = &quot;yllw&quot;</code>: <code>correct = &quot;&quot;</code> (no match)</li>
	</ul>
	</li>
</ul>

<p>In addition, the spell checker operates under the following precedence rules:</p>

<ul>
	<li>When the query exactly matches a word in the wordlist (<strong>case-sensitive</strong>), you should return the same word back.</li>
	<li>When the query matches a word up to capitlization, you should return the first such match in the wordlist.</li>
	<li>When the query matches a word up to vowel errors, you should return the first such match in the wordlist.</li>
	<li>If the query has no matches in the wordlist, you should return the empty string.</li>
</ul>

<p>Given some <code>queries</code>, return a list of words <code>answer</code>, where <code>answer[i]</code> is the correct word for <code>query = queries[i]</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<pre><strong>Input:</strong> wordlist = ["KiTe","kite","hare","Hare"], queries = ["kite","Kite","KiTe","Hare","HARE","Hear","hear","keti","keet","keto"]
<strong>Output:</strong> ["kite","KiTe","KiTe","Hare","hare","","","KiTe","","KiTe"]
</pre><p><strong class="example">Example 2:</strong></p>
<pre><strong>Input:</strong> wordlist = ["yellow"], queries = ["YellOw"]
<strong>Output:</strong> ["yellow"]
</pre>
<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= wordlist.length, queries.length &lt;= 5000</code></li>
	<li><code>1 &lt;= wordlist[i].length, queries[i].length &lt;= 7</code></li>
	<li><code>wordlist[i]</code> and <code>queries[i]</code> consist only of only English letters.</li>
</ul>

class Solution {
private:
    class entry {
    public:
        string  *s;
        int     idx;

        entry() = default;

        entry(string& str, int i) {
            s = &str;
            idx = i;
        }

        struct cmp {
            bool *string_match;

            bool operator()(const entry& e1, const entry& e2) const {
                if (*e1.s == *e2.s) {
                    if (e1.idx == -1 || e2.idx == -1)
                        *string_match = true;
                    return e1.idx < e2.idx;
                }

                return *e1.s < *e2.s;
            }
        };

        struct case_cmp {
            bool *string_match;

            bool operator()(const entry& e1, const entry& e2) const {
                string ls1, ls2;
                string::const_iterator it;

                for (it = e1.s->begin(); it != e1.s->end(); ++it)
                    ls1 += tolower(*it);
                for (it = e2.s->begin(); it != e2.s->end(); ++it)
                    ls2 += tolower(*it);

                if (ls1 == ls2) {
                    if (e1.idx == -1 || e2.idx == -1)
                        *string_match = true;
                    return e1.idx < e2.idx;
                }

                return ls1 < ls2;
            }
        };

        struct vowel_cmp {
        private:
            bool _vowel_cmp(const string& s1, const string& s2) const {
                string::const_iterator it1, it2;

                static const bool vowels[256] = {
                    [(unsigned char)'a'] = true,
                    [(unsigned char)'e'] = true,
                    [(unsigned char)'i'] = true,
                    [(unsigned char)'o'] = true,
                    [(unsigned char)'u'] = true
                };

                it1 = begin(s1);
                it2 = begin(s2);
                for (;;) {
                    char c1, c2;

                    if (it1 == end(s1)) {
                        if (it2 != end(s2))
                            return true;
                        break;
                    }
                    if (it2 == end(s2))
                        return false;
                    c1 = *it1;
                    c2 = *it2;
                    if (c1 != c2) {
                        bool v1, v2;

                        v1 = vowels[(unsigned char)c1];
                        v2 = vowels[(unsigned char)c2];
                        if (v1) {
                            if (!v2)
                                return true;
                        } else if (v2)
                            return false;
                        else
                            return c1 < c2;
                    }

                    ++it1;
                    ++it2;
                }

                return false;
            }

        public:
            bool *string_match;

            bool operator()(const entry& e1, const entry& e2) const {
                string ls1, ls2;
                string::const_iterator it;

                for (it = e1.s->begin(); it != e1.s->end(); ++it)
                    ls1 += tolower(*it);
                for (it = e2.s->begin(); it != e2.s->end(); ++it)
                    ls2 += tolower(*it);

                if (_vowel_cmp(ls1, ls2))
                    return true;

                if (!_vowel_cmp(ls2, ls1)) {
                    if (e1.idx == -1 || e2.idx == -1)
                        *string_match = true;
                    return e1.idx < e2.idx;
                }

                return false;
            }
        };
    };

public:
    vector<string> spellchecker(vector<string>& wordlist, vector<string>& queries) {
        bool string_match;
        entry e;
        int i, n;
        set<entry, entry::cmp> s1;
        set<entry, entry::cmp>::iterator it1;
        set<entry, entry::case_cmp> s2;
        set<entry, entry::case_cmp>::iterator it2;
        set<entry, entry::vowel_cmp> s3;
        set<entry, entry::vowel_cmp>::iterator it3;
        struct entry::cmp cmp1;
        struct entry::case_cmp cmp2;
        struct entry::vowel_cmp cmp3;
        vector<string> res;

        cmp1.string_match = cmp2.string_match = cmp3.string_match = &string_match;

        s1 = set<entry, struct entry::cmp>(cmp1);
        s2 = set<entry, struct entry::case_cmp>(cmp2);
        s3 = set<entry, struct entry::vowel_cmp>(cmp3);

        n = wordlist.size();

        for (i = 0; i < n; i++) {
            e = entry(wordlist[i], i);
            s1.insert(e);
            s2.insert(e);
            s3.insert(e);
        }

        n = queries.size();

        for (i = 0; i < n; i++) {
            e = entry(queries[i], -1);

            string_match = false;
            it1 = s1.lower_bound(e);
            if (string_match) {
                res.push_back(*it1->s);
                continue;
            }

            string_match = false;
            it2 = s2.lower_bound(e);
            if (string_match) {
                res.push_back(*it2->s);
                continue;
            }

            string_match = false;
            it3 = s3.lower_bound(e);
            if (string_match) {
                res.push_back(*it3->s);
                continue;
            }

            res.push_back("");
        }

        return res;
    }
};
39200