leetcode算法题--Regular Expression Matching

动态规划

状态转移方程

代码

func isMatch(s string, p string) bool {
   m, n := len(s), len(p)
   matches := func(i, j int) bool {
      // s为空，p不为空，则无法匹配
      if i == 0 {
         return false 
      }
      if p[j - 1] == '.' {
        return true 
      }

      return s[i - 1] == p[j - 1]
   } 

   dp := make([][]bool, m + 1)
   for i := 0; i <= m; i ++ {
      dp[i] = make([]bool, n + 1)
   }
   // 两个空串可以匹配 
   dp[0][0] = true
   for i := 0; i <= m; i ++ {
      for j := 1; j <= n; j ++ {
         if p[j - 1] == '*' {
            dp[i][j] = dp[i][j] || dp[i][j - 2]
            if matches(i, j - 1) {
               dp[i][j] = dp[i][j] || dp[i - 1][j] 
            }
         } else {
            if matches(i, j) {
               dp[i][j] = dp[i - 1][j -1] 
            } else {
               dp[i][j] = false
            }
         }
      }
   }

   return dp[m][n]
}