Leetcode 10. Regular Expression Matching 解题报告
Leetcode 10. Regular Expression Matching 解题报告
Enjoy233
发布于 2019-03-05 14:31:41
发布于 2019-03-05 14:31:41
文章被收录于专栏：大白技术控的技术自留地
Leetcode10. Regular Expression Matching
提交网址： https://leetcode.com/problems/regular-expression-matching/
Total Accepted: 79548 Total Submissions: 361279 Difficulty: Hard
Implement regular expression matching with support for '.' and '*'.
'.' Matches any single character.
'*' Matches zero or more of the preceding element.
The matching should cover the entire input string (not partial).
The function prototype should be:
bool isMatch(const char *s, const char *p)
Some examples:
isMatch("aa","a") → false
isMatch("aa","aa") → true
isMatch("aaa","aa") → false
isMatch("aa", "a*") → true
isMatch("aa", ".*") → true
isMatch("ab", ".*") → true
isMatch("aab", "c*a*b") → true本文参与 腾讯云自媒体同步曝光计划，分享自作者个人站点/博客。
原始发表：2016年05月07日，如有侵权请联系 cloudcommunity@tencent.com 删除
评论
登录后参与评论
推荐阅读
腾讯云开发者
