- 博客(10)
- 收藏
- 关注
原创 Palindrome Partitioning II
Calculate and maintain 2 DP states:pal[i][j] , which is whether s[i..j] forms a pald[i], which is the minCut for s[i..n-1]Once we comes to a pal[i][j]==true:if j==n-1, the string s
2014-10-16 16:32:45 351
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人