首页 > 编程语言 > 详细

[LeetCode][JavaScript]Regular Expression Matching

时间:2015-05-25 14:22:47      阅读:221      评论:0      收藏:0      [点我收藏+]

Regular Expression Matching

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

https://leetcode.com/problems/regular-expression-matching/

 

 






噗...

1 /**
2  * @param {string} s
3  * @param {string} p
4  * @return {boolean}
5  */
6 var isMatch = function(s, p) {
7     var reg = new RegExp("^" + p + "$");
8     return reg.test(s);
9 };

 



[LeetCode][JavaScript]Regular Expression Matching

原文:http://www.cnblogs.com/Liok3187/p/4527626.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!