标签:
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