목록132. Palindrome Partitioning II (1)

Scribbling

LeetCode: 132. Palindrome Partitioning II

1. Bottom-up Solution + predefining palindromic matrix class Solution: def minCut(self, s: str) -> int: dp = self.build_palindrome(s) n = len(s) self.cut = [2002] * n for end in range(n): if dp[0][end]: self.cut[end] = 0 continue for start in range(1, end+1): if dp[start][end]: self.cut[end] = min(self.cut[end], self.cut[start-1] + 1) return self.cut[-1] def build_palindrome(self, word): n = len..
Computer Science/Coding Test 2021. 11. 13. 12:53
이전 Prev 1 Next 다음