leetcode10_正則表達式匹配

1. 數組 2. 記dp[i][j]表示前i個源字符與前j個模式串字符是否匹配（含當前i,j這兩個字符）spa class Solution { public: bool isMatch(string s, string p) { int len1 = s.length(), len2 = p.length(); vector<vector<int>> dp(len1 + 1, vect

>>阅读原文<<