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

class Solution:
    # @return a boolean
    def isMatch(self, s, p):
        mark = [[False for j in range(len(s)+1)] for i in range(len(p)+1)]
        for i in range(len(p)+1):
            for j in range(len(s)+1):
                #special situation
                if i==0 or j==0:
                    if i==0 and j==0:
                        mark[i][j]=True
                    elif i!=0 and j==0:
                        if i>=2:#p[0]=='*' make no sense
                            mark[i][j]=mark[i-2][j] and p[i-1]=='*'
                #other situation
                else:
                    if p[i-1]=='.':
                        mark[i][j]=mark[i-1][j-1]
                    elif p[i-1]=='*':
                        mark[i][j]= mark[i-2][j] or \
                                    mark[i-1][j] or \
                                    (mark[i][j-1] and (p[i-2] == s[j-1] or p[i-2]=='.'))
                    else:
                        mark[i][j]=mark[i-1][j-1] and (p[i-1]==s[j-1])

        return mark[-1][-1]