Lintcode154 · Regular Expression Matching go

/**
154 · Regular Expression Matching
Algorithms
Hard
Accepted Rate
31%

DescriptionSolutionNotesDiscussLeaderboard
Description
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(string s, string p)

isMatch(“aa”,“a”) → false

isMatch(“aa”,“aa”) → true

isMatch(“aaa”,“aa”) → false

isMatch(“aa”, “a*”) → true

isMatch(“aa”, “.*”) → true

isMatch(“ab”, “.*”) → true

isMatch(“aab”, “cab”) → true

Example
Example 1:

Input：“aa”，“a”
Output：false
Explanation：
unable to match
Example 2:

Input：“aa”，“a*”
Output：true
Explanation：
‘*’ can repeat a
Tags
Related Problems

https://blog.csdn.net/qq_46105170/article/details/109213897

https://www.lintcode.com/problem/154/
*/

WA， -_-||， 有知道哪里错误的朋友希望指点下

import "fmt"

/**
 * @param s: A string
 * @param p: A string includes "." and "*"
 * @return: A boolean
 */
func isMatch(s string, p string) bool {
	// write your code here
	var dp [][]bool = make([][]bool, len(s)+1)
	for i := 0; i < len(s)+1; i++ {
		dp[i] = make([]bool, len(p)+1)
	}
	for i := 0; i <= len(s); i++ {
		for j := 0; j <= len(p); j++ {
			if i == 0 && j == 0 {
				dp[i][j] = true
			} else if j == 0 {
				dp[i][j] = false
			} else {
				if rune(p[j-1]) != '*' {
					if i-1 >= 0 && (rune(p[j-1]) == rune(s[i-1]) || rune(p[j-1]) == '.') {
						dp[i][j] = dp[i-1][j-1]
					} else {
						if j-2 >= 0 {
							dp[i][j] = dp[i][j] || dp[i][j-2]
						}
						if i >= 1 && j >= 2 {
							dp[i][j] = dp[i][j] || (dp[i-1][j] && (rune(p[j-2]) == rune(s[i-1]) || p[j-2] == '.'))
						}
					}
				}
			}
		}
	}
	return dp[len(s)][len(p)]
}

func main() {
	var r1 = isMatch("aa", "a*")
	//true
	fmt.Println(r1)
}