[Leetcode] 591. Tag Validator 解题报告

题目：

Given a string representing a code snippet, you need to implement a tag validator to parse the code and return whether it is valid. A code snippet is valid if all the following rules hold:

1. The code must be wrapped in a valid closed tag. Otherwise, the code is invalid.
2. A closed tag (not necessarily valid) has exactly the following format : <TAG_NAME>TAG_CONTENT</TAG_NAME>. Among them, <TAG_NAME> is the start tag, and </TAG_NAME> is the end tag. The TAG_NAME in start and end tags should be the same. A closed tag is valid if and only if the TAG_NAME and TAG_CONTENT are valid.
3. A valid TAG_NAME only contain upper-case letters, and has length in range [1,9]. Otherwise, the TAG_NAME is invalid.
4. A valid TAG_CONTENT may contain other valid closed tags, cdata and any characters (see note1) EXCEPT unmatched <, unmatched start and end tag, and unmatched or closed tags with invalid TAG_NAME. Otherwise, the TAG_CONTENT is invalid.
5. A start tag is unmatched if no end tag exists with the same TAG_NAME, and vice versa. However, you also need to consider the issue of unbalanced when tags are nested.
6. A < is unmatched if you cannot find a subsequent >. And when you find a < or </, all the subsequent characters until the next > should be parsed as TAG_NAME (not necessarily valid).
7. The cdata has the following format : <![CDATA[CDATA_CONTENT]]>. The range of CDATA_CONTENT is defined as the characters between <![CDATA[ and the first subsequent ]]>.
8. CDATA_CONTENT may contain any characters. The function of cdata is to forbid the validator to parse CDATA_CONTENT, so even it has some characters that can be parsed as tag (no matter valid or invalid), you should treat it as regular characters.

Valid Code Examples:

Input: "<DIV>This is the first line <![CDATA[<div>]]></DIV>"

Output: True

Explanation: 

The code is wrapped in a closed tag : <DIV> and </DIV>. 

The TAG_NAME is valid, the TAG_CONTENT consists of some characters and cdata. 

Although CDATA_CONTENT has unmatched start tag with invalid TAG_NAME, it should be considered as plain text, not parsed as tag.

So TAG_CONTENT is valid, and then the code is valid. Thus return true.


Input: "<DIV>>>  ![cdata[]] <![CDATA[<div>]>]]>]]>>]</DIV>"

Output: True

Explanation:

We first separate the code into : start_tag|tag_content|end_tag.

start_tag -> "<DIV>"

end_tag -> "</DIV>"

tag_content could also be separated into : text1|cdata|text2.

text1 -> ">>  ![cdata[]] "

cdata -> "<![CDATA[<div>]>]]>", where the CDATA_CONTENT is "<div>]>"

text2 -> "]]>>]"


The reason why start_tag is NOT "<DIV>>>" is because of the rule 6.
The reason why cdata is NOT "<![CDATA[<div>]>]]>]]>" is because of the rule 7.

Invalid Code Examples:

Input: "<A>  <B> </A>   </B>"
Output: False
Explanation: Unbalanced. If "<A>" is closed, then "<B>" must be unmatched, and vice versa.

Input: "<DIV>  div tag is not closed  <DIV>"
Output: False

Input: "<DIV>  unmatched <  </DIV>"
Output: False

Input: "<DIV> closed tags with invalid tag name  <b>123</b> </DIV>"
Output: False

Input: "<DIV> unmatched tags with invalid tag name  </1234567890> and <CDATA[[]]>  </DIV>"
Output: False

Input: "<DIV>  unmatched start tag <B>  and unmatched end tag </C>  </DIV>"
Output: False

Note:

1. For simplicity, you could assume the input code (including the any characters mentioned above) only contain letters, digits, '<','>','/','!','[',']' and ' '.

思路：

1、顺序解析：通过分析我们可以知道，我们实际上只有三种类型需要解析：cdata，ending tag和starting tag，而plain text可以无视。但是由于一个closed tag还可以包含closed tag，所以这种数据实际上构成了一棵树，因此特别适合用栈来解析：当遇到一个cdata的起始字符串"<![CDATA["的时候，我们就忽略中间的所有字符，直到找到cdata的特定结尾字符串“]]>”；当遇到一个ending tag的起始字符串"</"的时候，我们首先解析tag name并判断其合法性，然后查看栈顶元素是否匹配；当遇到一个starting tag的起始字符串"<"的时候，我们还是首先解析tag name并判断其合法性，如果合法，就将其放入栈中。当处理完所有字符的时候，栈应该为空，否则就说明字符串不合法。

2、递归解析：这道题目让我们很容易想到《编译原理》中学到的文法解析方法。首先总结一下这里出现的文法规律：

tag：<tagname> + content + </tagname>

tagname：[A-Z]{1, 9} # 1~9 uppercase chars

content：(tag | cdata | text)* # 0 or more number of tag, cdata or text

cdata："<![CDATA[" + .* + "]]>" # any number of any chars, including spaces

text：[^<]+ # any number of any chars except '<'

有了以上的文法规律，我们就可以分别为每种元素构造解析函数。具体可以参加下面对应的代码片段。

代码：

1、顺序解析：

class Solution {
public:
    bool isValid(string code) {
        stack<string> stk;
        for (int i = 0; i < code.length(); i++) {        
            if (i > 0 && stk.empty()) {                 // extra ending tag encountered
                return false;
            }
            if (code.substr(i, 9) == "<![CDATA[") {     // parse the cdata
                int j = i + 9;
                i = code.find("]]>", j);
                if (i < 0) {
                    return false;
                }
                i += 2;
            }
            else if (code.substr(i, 2) == "</") {       // parse the ending tag
                int j = i + 2;
                i = code.find('>', j);
                string s = code.substr(j, i - j);       // get the content
                if (stk.empty() || s != stk.top()) {
                    return false;
                }
                stk.pop();
            }
            else if (code.substr(i, 1) == "<") {        // parse the starting tag
                int j = i + 1;
                i = code.find('>', j);
                if (i < 0 || i == j || i - j > 9) {
                    return false;
                }
                for (int k = j; k < i; k++) {
                    if (!isupper(code[k])) {
                        return false;
                    }
                }
                string s = code.substr(j, i - j);
                stk.push(s);
            }
        }
        return stk.empty();
    }
};

2、递归解析：

class Solution {
public:
    bool isValid(string code) {
        int i = 0;
        return validTag(code, i) && i == code.size();
    }
private:
    bool validTag(string s, int& i) {
        int j = i;
        string tag = parseTagName(s, j);    // parse the tag name
        if (tag.empty()) {
            return false;
        }
        if (!validContent(s, j)) {
            return false;
        }
        int k = j + tag.size() + 2; // expecting j = pos of "</" , k = pos of '>'
        if (k >= s.size() || s.substr(j, k + 1 - j) != "</" + tag + ">") return false;
        i = k + 1;
        return true;
    }
    string parseTagName(string s, int& i) { // return "" if the tag name is not valid
        if (s[i] != '<') {
            return "";
        }
        int j = s.find('>', i);
        if (j == string::npos || j - i <= 1 || 9 < j - 1 - i) {
            return "";
        }
        string tag = s.substr(i + 1, j - 1 - i);
        for (char ch : tag) {
            if (ch < 'A' || 'Z' < ch) {
                return "";
            }
        }
        i = j + 1;
        return tag;
    }
    bool validContent(string s, int& i) {
        int j = i;
        while (j < s.size()) {
            if (!validText(s, j) && !validCData(s, j) && !validTag(s, j)) {
                break;
            }
        }
        i = j;
        return true;
    }

    bool validText(string s, int& i) {
        int j = i;
        while (i < s.size() && s[i] != '<') {
            ++i; 
        }
        return i != j;
    }

    bool validCData(string s, int& i) {
        if (s.find("<![CDATA[", i) != i) {
            return false;
        }
        int j = s.find("]]>", i);
        if (j == string::npos) {
            return false;
        }
        i = j + 3;
        return true;
    }
};