[LeetCode][Java] Regular Expression Matching

原创 2015年07月08日 20:54:40

题目:

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

题意:

实现匹配 '.' and '*'的正则表达式。

'.' 和任何的字符匹配。

'*' ‘*’匹配0个或多个前一字符

匹配应该覆盖整个字符串而不是字符串的部分匹配。

算法分析:

 * 递归。根据下一个字符是否是'*'分情况判断。


    如果p的下一个字符不是'*',只需判断当前字符是否相等,或者p[cur]='.',递归处理s[1]和p[1];
    如果是p的下一个'*',则当前s和p相等或者p='.'情况下,依次判断s[0...s.length]和p2]是否match;

AC代码:

public class Solution 
{
  public boolean isMatch(String s, String p) 
  {
        if (s == null)
            return p == null;
        if (p == null)
            return s == null;
 
        int lenS = s.length();
        int lenP = p.length();
 
        if (lenP == 0)
            return lenS == 0;
 
        if (lenP == 1) 
        {
            if (p.equals(s) || p.equals(".") && s.length() == 1) 
                return true;
            else
                return false;
        }
        if (p.charAt(1) != '*') 
        {
            if (s.length() > 0&& (p.charAt(0) == s.charAt(0) || p.charAt(0) == '.')) 
            {
                return isMatch(s.substring(1), p.substring(1));
            }
            return false;
        } 
        else 
        {
            while (s.length() > 0 && (p.charAt(0) == s.charAt(0) || p.charAt(0) == '.')) //前一字符匹配
            {
                if (isMatch(s, p.substring(2)))
                    return true;
                s = s.substring(1);
            }
            //don's skip this line, s is now ""
            return isMatch(s, p.substring(2));
        }
    }
}


版权声明:本文为博主原创文章,转载注明出处

相关文章推荐

leetcode10-Regular Expression Matching之Java版本

我的leetcode之旅,该篇章主要完成使用Java实现算法。这是第10篇Regular Expression Matching

LeetCode : Regular Expression Matching [java]

Implement regular expression matching with support for '.' and '*'. '.' Matches any single characte...

[leetcode]10. Regular Expression Matching(Java)

https://leetcode.com/problems/regular-expression-matching/#/description Implement regular expre...

LeetCode 10 Regular Expression Matching (C,C++,Java,Python)

Problem: Implement regular expression matching with support for '.' and '*'. '.' Matches any singl...

LEETCODE 10 Regular Expression Matching (JAVA题解)

LEETCODE 10 Regular Expression Matching (JAVA题解)

[LeetCode] 010. Regular Expression Matching (Hard) (C++/Java/Python)

[LeetCode] 010. Regular Expression Matching (Hard) (C++/Java/Python)
  • hcbbt
  • hcbbt
  • 2015-03-02 11:20
  • 4204

leetcode 10.Regular Expression Matching(正则表达式匹配) 解题思路和方法

Regular Expression Matching Implement regular expression matching with support for '.' and '*'. ...

LeetCode之10 --- Regular Expression Matching

题目:   , Implement regular expression matching with support for '.' and '*'. '.' Matches any sin...

leetcode 10. Regular Expression Matching

leetcode 10. Regular Expression Matching 只有两种特殊字符*和. 动态规划DPempty text与empty pattern是match的用状态表T[i +...

[LeetCode] Regular Expression Matching 解题报告

[题目] mplement regular expression matching with support for ‘.’ and ‘*’. ‘.’ Matches any single ch...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)