Leetcode||10.Regular Expression Matching

10. Regular Expression Matching

• Total Accepted: 104860
• Total Submissions: 452500
• Difficulty: Hard
• Contributors: Admin

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

正则表达式……看完题目就想吐血，做法是深搜。

代码如下：

public class Solution {
    public boolean isMatch(String s, String p) {
        if (0==p.length()) {
			return 0==s.length();
		}
		if (1==p.length()||'*'!=p.charAt(1)) {
			if (1>s.length()||('.'!=p.charAt(0)&&s.charAt(0)!=p.charAt(0))) {
				return false;
			}
			return isMatch(s.substring(1), p.substring(1));
		}
		int len = s.length();
		int i = -1;
		while (i<len&&(i< 0||'.' == p.charAt(0)||p.charAt(0)==s.charAt(i))) {
			if (isMatch(s.substring(i+1), p.substring(2))) {
				return true;
			}
			i++;
		}
        return false;
    }
}