Update 647.回文子串.py

linwt · web-flow · commit 709ed828e73e · 2019-06-05T19:16:38.000+08:00
diff --git a/leetcode/647.回文子串.py b/leetcode/647.回文子串.py
@@ -1,4 +1,4 @@
-# dp[i][j]表示以s[i]开头s[j]结尾的字符串是否为回文串
+# dp[i][j]表示以s[i]开头、s[j]结尾的字符串是否为回文串
 class Solution(object):
     def countSubstrings(self, s):
         n = len(s)
@@ -9,6 +9,11 @@ def countSubstrings(self, s):
                 dp[i][j] = dp[i+1][j-1] and s[i] == s[j]
         # 计算二维数组的和并减去下三角的和
         return sum(map(sum, dp)) - (n*(n-1)/2)
+# a 0 0 0 1
+# 1 b 0 1 0
+# 1 1 c 0 0
+# 1 1 1 b 0
+# 1 1 1 1 a
 
 
 # 暴力破解，遍历所有子串，是回文串则加1
@@ -19,4 +24,4 @@ def countSubstrings(self, s):
             for j in range(i+1, len(s)+1):
                 if s[i:j] == s[i:j][::-1]:
                     res += 1
-        return res
+        return res
