1410. HTML Entity Parser

1410. HTML Entity Parser (Medium)

HTML entity parser is the parser that takes HTML code as input and replace all the entities of the special characters by the characters itself.

The special characters and their entities for HTML are:

• Quotation Mark: the entity is " and symbol character is ".
• Single Quote Mark: the entity is ' and symbol character is '.
• Ampersand: the entity is & and symbol character is &.
• Greater Than Sign: the entity is > and symbol character is >.
• Less Than Sign: the entity is < and symbol character is <.
• Slash: the entity is ⁄ and symbol character is /.

Given the input text string to the HTML parser, you have to implement the entity parser.

Return the text after replacing the entities by the special characters.

 

Example 1:

Input: text = "& is an HTML entity but &ambassador; is not."
Output: "& is an HTML entity but &ambassador; is not."
Explanation: The parser will replace the & entity by &

Example 2:

Input: text = "and I quote: "...""
Output: "and I quote: \"...\""

Example 3:

Input: text = "Stay home! Practice on Leetcode :)"
Output: "Stay home! Practice on Leetcode :)"

Example 4:

Input: text = "x > y && x < y is always false"
Output: "x > y && x < y is always false"

Example 5:

Input: text = "leetcode.com⁄problemset⁄all"
Output: "leetcode.com/problemset/all"

 

Constraints:

• 1 <= text.length <= 10^5
• The string may contain any possible characters out of all the 256 ASCII characters.

Related Topics:
String, Stack

Solution 1. Brute force

Once found a &, read the string from & to ; into entity. If entity is a known html entity, append the corresponding symbol to the result; otherwise, append the entity to the result.

// OJ: https://leetcode.com/problems/html-entity-parser/
// Author: github.com/lzl124631x
// Time: O(N^2)
// Space: O(N)
class Solution {
public:
    string entityParser(string s) {
        int N = s.size(), i = 0;
        string ans;
        while (i < N) {
            if (s[i] != '&') ans += s[i++];
            else {
                string ent;
                do {
                    ent += s[i++];
                } while (i < N && s[i - 1] != ';');
                if (ent == "&quot;") ans += "\""; 
                else if (ent == "&apos;" ) ans += "\'"; 
                else if (ent == "&amp;" ) ans += "&"; 
                else if (ent == "&gt;" ) ans += ">"; 
                else if (ent == "&lt;" ) ans += "<"; 
                else if (ent == "&frasl;" ) ans += "/"; 
                else ans += ent;
            }
        }
        return ans;
    }
};