leetcode647,5(连续),516(不连续)
class Solution:
def countSubstrings(self, s: str) -> int:
dp=[[False for _ in range(len(s))] for _ in range(len(s))]
res=0
for i in range(len(s)-1,-1,-1):#dp[i][j]由i+1,j-1推出来,所以从左下往右上推。决定了遍历顺序。
for j in range(i,l.
原创
2021-06-29 16:13:45 ·
78 阅读 ·
0 评论