PU Valid Word Abbreviation

Given a non-empty string s and an abbreviation abbr, return whether the string matches with the given abbreviation.

A string such as "word" contains only the following valid abbreviations:

["word", "1ord", "w1rd", "wo1d", "wor1", "2rd", "w2d", "wo2", "1o1d", "1or1", "w1r1", "1o2", "2r1", "3d", "w3", "4"]

Notice that only the above abbreviations are valid abbreviations of the string "word". Any other string is not a valid abbreviation of "word".

Note:

• Assume s contains only lowercase letters and abbr contains only lowercase letters and digits.

Example 1:

• Given s = "internationalization", abbr = "i12iz4n":
• Return true.

Example 2:

• Given s = "apple", abbr = "a2e":
• Return false.

C Solution:

bool validWordAbbreviation(char* word, char* abbr) {
    int len = 0;
    while (*abbr) {
        if (*abbr > '9' || *abbr < '0') {
            if (*abbr++ != *word++) return false;
        }
        else {
            if (*abbr == '0' && len == 0) return false;
            len = len * 10 + *abbr++ - '0';
            if (!*abbr || *abbr > '9' || *abbr < '0') {
                while (len) {
                    if (!*word++) return false;
                    len--;
                }
            }
        }
    }
    return !*word;
}

Summary:

• Similar to Length of Last Word
• Nice way to solve string problem.

LeetCode: 408. Valid Word Abbreviation