码迷,mamicode.com
首页 > 其他好文 > 详细

10. Regular Expression Matching

时间:2015-04-16 01:14:18      阅读:124      评论:0      收藏:0      [点我收藏+]

标签:

题目:

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

链接:http://leetcode.com/problems/regular-expression-matching/

题解:

10. Regular Expression Matching

标签:

原文地址:http://www.cnblogs.com/yrbbest/p/4430699.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!