【leetcode】1023. Camelcase Matching

题目如下：

解题思路：这种模式匹配的题目，感觉还是用正则表达式简单些。例如 pattern = "FoBaT"，转换成正则表达式的pattern="^[a-z]*F[a-z]*o[a-z]*B[a-z]*a[a-z]*T[a-z]*$"。

代码如下：

class Solution(object):

    def camelMatch(self, queries, pattern):

        """

        :type queries: List[str]

        :type pattern: str

        :rtype: List[bool]

        """

        res = []

        import re

        rePattern = '^[a-z]*'

        for i,v in enumerate(pattern):

            rePattern += v

            rePattern += '[a-z]*'

        #rePattern = rePattern[:-2]

        rePattern += '$'

        for i in queries:

            r = re.search(rePattern, i)

            if r == None:

                res.append(False)

                continue

            r = r.group()

            subq = i[len(r):]

            res.append(len(subq) == 0 or subq.islower())

        return res