132. Palindrome Partitioning II Leetcode Python

Given a string s, partition s such that every substring of the partition is a palindrome.
Return the minimum cuts needed for a palindrome partitioning of s.
For example, given s =  "aab" ,
Return  1  since the palindrome partitioning  ["aa","b"]  could be produced using 1 cut.
この問題は動的計画で解くことができる.数字を返すだけだからだ.
1つのdp配列を用いてどれだけの分割が必要かを表し、1つのp[i][j]はiからjがpalindromeであるかどうかを表す.
コードは次のとおりです.

class Solution:
    # @param s, a string
    # @return an integer
    def minCut(self, s):
        dp=[0 for i in range(len(s)+1)]
        p=[[False for i in range(len(s))] for j in range(len(s))]
        for i in range(len(s)+1):
            dp[i]=len(s)-i
        for i in reversed(range(len(s))):
            for j in range(i,len(s)):
                if s[i]==s[j] and (j-i<2 or p[i+1][j-1]==True):
                    p[i][j]=True
                    dp[i]=min(dp[i],dp[j+1]+1)
        return dp[0]-1