zoukankan      html  css  js  c++  java
  • 【leetcode】1410. HTML Entity Parser

    题目如下:

    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 &lt; and symbol character is <.
    • Slash: the entity is &frasl; 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 = "&amp; is an HTML entity but &ambassador; is not."
    Output: "& is an HTML entity but &ambassador; is not."
    Explanation: The parser will replace the &amp; entity by &
    

    Example 2:

    Input: text = "and I quote: &quot;...&quot;"
    Output: "and I quote: "...""
    

    Example 3:

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

    Example 4:

    Input: text = "x &gt; y &amp;&amp; x &lt; y is always false"
    Output: "x > y && x < y is always false"
    

    Example 5:

    Input: text = "leetcode.com&frasl;problemset&frasl;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.

    解题思路:遍历text,遇到&后要判断后面的字符组成的子串是否是XML的特殊符号。

    代码如下:

    class Solution(object):
        def entityParser(self, text):
            """
            :type text: str
            :rtype: str
            """
            res = ''
            pending = ''
            #entity = ['&quot;','&apos;','&amp;','&gt;','&lt','&frasl;']
            dic = {}
            dic['&quot;'] = '"'
            dic['&apos;'] = "'"
            dic['&amp;'] = '&'
            dic['&gt;'] = '>'
            dic['&lt;'] = '<'
            dic['&frasl;'] = '/'
            for c in text:
                if len(pending) == 0:
                    if c == '&':
                        pending += c
                        continue
                    else:res += c
                else:
                    pending += c
    
                    if pending in dic.viewkeys():
                        res += dic[pending]
                        pending = ''
                        continue
    
                    isPrefix = False
                    for e in dic.iterkeys():
                        if e.startswith(pending) and pending != e:
                            isPrefix = True
                            break
    
                    if isPrefix == False:
                        res += pending
                        pending = ''
            return res
  • 相关阅读:
    lightoj 1094 Farthest Nodes in a Tree 【树的直径 裸题】
    nyoj 1185 最大最小值【线段树最大值最小值维护】
    nyoj 123 士兵杀敌(四) 树状数组【单点查询+区间修改】
    poj 3468 A Simple Problem with Integers【线段树区间修改】
    hdoj 1698 Just a Hook【线段树区间修改】
    hdoj 1556 Color the ball【线段树区间更新】
    hdoj 1286 找新朋友【欧拉函数】
    [LC] 303. Range Sum Query
    [LC] 79. Word Search
    [LC] 211. Add and Search Word
  • 原文地址:https://www.cnblogs.com/seyjs/p/12985241.html
Copyright © 2011-2022 走看看