Python题目，求讲解代码，大佬勿喷

n = int(input())
s = input()
s = ' ' + s
dp = [[0 for i in range(101)] for j in range(101)]

for j in range(1, n + 1):
    for i in range(j, 0, -1):
        if j == i:
            dp[i][j] = 1
            continue
        dp[i][j] = dp[i][j - 1] + 1
        if s[j] == s[j - 1]:
            dp[i][j] = min(dp[i][j - 1], dp[i][j])
        if s[j] == s[i]:
            dp[i][j] = min(dp[i + 1][j - 1] + 1, dp[i][j])
        if s[i] == s[i + 1]:
            dp[i][j] = min(dp[i + 1][j], dp[i][j])
        for k in range(i, j):
            dp[i][j] = min(dp[i][k] + dp[k + 1][j], dp[i][j])

for i in range(1, n + 1):
    for j in range(1, n + 1):
        print(dp[i][j], end=' ')
    print()


print(dp[1][n])