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
  • 相关阅读:
    游遍中国 —— 大街小巷、秘境与远方
    Batch Normalization 反向传播(backpropagation )公式的推导
    Batch Normalization 反向传播(backpropagation )公式的推导
    【社会/人文】概念的理解 —— 断舍离、饭(饭制版)
    【社会/人文】概念的理解 —— 断舍离、饭(饭制版)
    linux 线程的同步 一 (互斥量和信号量)
    linux find
    正则表达式30分钟入门教程-新
    linux sed命令详解 *****
    linux vim tutor
  • 原文地址:https://www.cnblogs.com/seyjs/p/12985241.html
Copyright © 2011-2022 走看看