[leetcode-10] Regular Expression Matching
ยท
๐Ÿข One step
LeetCode-10 Regular Expression Matching : Given an input string s and a pattern p, implement regular expression matching note : The matching should cover the entire input string (not partial).Answer :::python class Solution: def isMatch(self, s: str, p: str) -> bool: if len(re.findall(p,s))>0: return s == re.findall(p,s)[0] else: return False Result : 201ms Memory: 13.9mbSolve :::python class So..
๋‹คํ–ˆ๋‹ค
'10' ํƒœ๊ทธ์˜ ๊ธ€ ๋ชฉ๋ก