688ms, 50%, 80%.

Author: Jeromestein

131.palindrome-partitioning.py

@@ -0,0 +1,30 @@
+#
+# @lc app=leetcode id=131 lang=python3
+#
+# [131] Palindrome Partitioning
+#
+
+# @lc code=start
+
+class Solution:
+    def partition(self, s: str) -> List[List[str]]:
+        res = []
+        self.dfs(s, [], res)
+        return res
+
+    def dfs(self, s, path, res):
+        # if s is empty
+        if not s:
+            res.append(path)
+            return
+
+        for i in range(1, len(s)+1):
+            if self.isPal(s[:i]):
+                self.dfs(s[i:], path+[s[:i]], res)
+
+    def isPal(self, s):
+        # s is equal to reversed s
+        return s == s[::-1]
+
+
+# @lc code=end