python leetcode 131. Palindrome Partitioning

虽然是求所有情况，但用dp也能做，不需要DFS。仔细想想这里的动态转移方程会大有收获。

class Solution:
    def partition(self, s):
        """
        :type s: str
        :rtype: List[List[str]]
        """
        dp = [[] for _ in range(len(s)+1)]
        for i in range(1, len(s)+1):
            for j in range(i):
                if self.isPalindrome(s[j:i]):
                    if len(dp[j]) > 0:
                        for l in dp[j]:
                            dp[i].append(l+[s[j:i]])
                    else:
                        dp[i].append([s[j:i]])
        
        return dp[-1]
                        
    def isPalindrome(self,s):
        for i in range(len(s)>>1):
            if s[i] != s[len(s)-1-i]:
                return False 
        return True