+ problem 131

Author: fruit-in

Problemset/0131-Palindrome Partitioning/README.md

@@ -0,0 +1,40 @@
+# 131. Palindrome Partitioning
+Given a string `s`, partition `s` such that every substring of the partition is a **palindrome**. Return *all possible palindrome partitioning of* `s`.
+
+#### Example 1:
+<pre>
+<strong>Input:</strong> s = "aab"
+<strong>Output:</strong> [["a","a","b"],["aa","b"]]
+</pre>
+
+#### Example 2:
+<pre>
+<strong>Input:</strong> s = "a"
+<strong>Output:</strong> [["a"]]
+</pre>
+
+#### Constraints:
+* `1 <= s.length <= 16`
+* `s` contains only lowercase English letters.
+
+## Solutions (Python)
+
+### 1. Solution
+```Python
+from functools import lru_cache
+
+
+class Solution:
+    @lru_cache()
+    def partition(self, s: str) -> List[List[str]]:
+        if len(s) == 0:
+            return [[]]
+
+        ret = []
+
+        for i in range(1, len(s) + 1):
+            if s[:i] == s[:i][::-1]:
+                ret.extend([[s[:i]] + x for x in self.partition(s[i:])])
+
+        return ret
+```

Problemset/0131-Palindrome Partitioning/README_CN.md

@@ -0,0 +1,40 @@
+# 131. 分割回文串
+给你一个字符串 `s`，请你将 `s` 分割成一些子串，使每个子串都是 **回文串** 。返回 `s` 所有可能的分割方案。
+
+#### 示例 1:
+<pre>
+<strong>输入:</strong> s = "aab"
+<strong>输出:</strong> [["a","a","b"],["aa","b"]]
+</pre>
+
+#### 示例 2:
+<pre>
+<strong>输入:</strong> s = "a"
+<strong>输出:</strong> [["a"]]
+</pre>
+
+#### 提示:
+* `1 <= s.length <= 16`
+* `s` 仅由小写英文字母组成
+
+## 题解 (Python)
+
+### 1. 题解
+```Python
+from functools import lru_cache
+
+
+class Solution:
+    @lru_cache()
+    def partition(self, s: str) -> List[List[str]]:
+        if len(s) == 0:
+            return [[]]
+
+        ret = []
+
+        for i in range(1, len(s) + 1):
+            if s[:i] == s[:i][::-1]:
+                ret.extend([[s[:i]] + x for x in self.partition(s[i:])])
+
+        return ret
+```

Problemset/0131-Palindrome Partitioning/Solution.py

@@ -0,0 +1,16 @@
+from functools import lru_cache
+
+
+class Solution:
+    @lru_cache()
+    def partition(self, s: str) -> List[List[str]]:
+        if len(s) == 0:
+            return [[]]
+
+        ret = []
+
+        for i in range(1, len(s) + 1):
+            if s[:i] == s[:i][::-1]:
+                ret.extend([[s[:i]] + x for x in self.partition(s[i:])])
+
+        return ret

README.md

@@ -108,6 +108,7 @@
 [122][122l]  |[Best Time to Buy and Sell Stock II][122]                                             |![rs]
 [125][125l]  |[Valid Palindrome][125]                                                               |![py]
 [129][129l]  |[Sum Root to Leaf Numbers][129]                                                       |![py]
+[131][131l]  |[Palindrome Partitioning][131]                                                        |![py]
 [133][133l]  |[Clone Graph][133]                                                                    |![py]
 [134][134l]  |[Gas Station][134]                                                                    |![rb]  ![rs]
 [136][136l]  |[Single Number][136]                                                                  |![rs]
@@ -1536,6 +1537,7 @@
 [122]:Problemset/0122-Best%20Time%20to%20Buy%20and%20Sell%20Stock%20II/README.md#122-best-time-to-buy-and-sell-stock-ii
 [125]:Problemset/0125-Valid%20Palindrome/README.md#125-valid-palindrome
 [129]:Problemset/0129-Sum%20Root%20to%20Leaf%20Numbers/README.md#129-sum-root-to-leaf-numbers
+[131]:Problemset/0131-Palindrome%20Partitioning/README.md#131-palindrome-partitioning
 [133]:Problemset/0133-Clone%20Graph/README.md#133-clone-graph
 [134]:Problemset/0134-Gas%20Station/README.md#134-gas-station
 [136]:Problemset/0136-Single%20Number/README.md#136-single-number
@@ -2958,6 +2960,7 @@
 [122l]:https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/
 [125l]:https://leetcode.com/problems/valid-palindrome/
 [129l]:https://leetcode.com/problems/sum-root-to-leaf-numbers/
+[131l]:https://leetcode.com/problems/palindrome-partitioning/
 [133l]:https://leetcode.com/problems/clone-graph/
 [134l]:https://leetcode.com/problems/gas-station/
 [136l]:https://leetcode.com/problems/single-number/

README_CN.md

@@ -108,6 +108,7 @@
 [122][122l]  |[买卖股票的最佳时机 II][122]                              |![rs]
 [125][125l]  |[验证回文串][125]                                         |![py]
 [129][129l]  |[求根到叶子节点数字之和][129]                             |![py]
+[131][131l]  |[分割回文串][131]                                         |![py]
 [133][133l]  |[克隆图][133]                                             |![py]
 [134][134l]  |[加油站][134]                                             |![rb]  ![rs]
 [136][136l]  |[只出现一次的数字][136]                                   |![rs]
@@ -1536,6 +1537,7 @@
 [122]:Problemset/0122-Best%20Time%20to%20Buy%20and%20Sell%20Stock%20II/README_CN.md#122-买卖股票的最佳时机-ii
 [125]:Problemset/0125-Valid%20Palindrome/README_CN.md#125-验证回文串
 [129]:Problemset/0129-Sum%20Root%20to%20Leaf%20Numbers/README_CN.md#129-求根到叶子节点数字之和
+[131]:Problemset/0131-Palindrome%20Partitioning/README_CN.md#131-分割回文串
 [133]:Problemset/0133-Clone%20Graph/README_CN.md#133-克隆图
 [134]:Problemset/0134-Gas%20Station/README_CN.md#134-加油站
 [136]:Problemset/0136-Single%20Number/README_CN.md#136-只出现一次的数字
@@ -2958,6 +2960,7 @@
 [122l]:https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-ii/
 [125l]:https://leetcode.cn/problems/valid-palindrome/
 [129l]:https://leetcode.cn/problems/sum-root-to-leaf-numbers/
+[131l]:https://leetcode.cn/problems/palindrome-partitioning/
 [133l]:https://leetcode.cn/problems/clone-graph/
 [134l]:https://leetcode.cn/problems/gas-station/
 [136l]:https://leetcode.cn/problems/single-number/