题目：
题解：
class Solution:def minCut(self, s: str) -> int:n = len(s)g = [[True] * n for _ in range(n)]for i in range(n - 1, -1, -1):for j in range(i + 1, n):g[i][j] = (s[i] == s[j]) and g[i + 1][j - 1]f = [float("inf")] * nfor i in range(n):if g[0][i]:f[i] = 0else:for j in range(i):if g[j + 1][i]:f[i] = min(f[i], f[j] + 1)return f[n - 1]
