add 1147

Author: luliyucoordinate

README.md

@@ -468,4 +468,5 @@ LeetCode
 |1140|[Stone Game II](https://leetcode.com/problems/stone-game-ii/) | c | [c++](./src/1140-Stone-Game-II/1140.cpp) |[python](./src/1140-Stone-Game-II/1140.py)|[go](./src/1140-Stone-Game-II/1140.go)|[js](./src/1140-Stone-Game-II/1140.js)|Medium|
 |1144|[Decrease Elements To Make Array Zigzag](https://leetcode.com/problems/decrease-elements-to-make-array-zigzag/) | c | [c++](./src/1144-Decrease-Elements-To-Make-Array-Zigzag/1144.cpp) |[python](./src/1144-Decrease-Elements-To-Make-Array-Zigzag/1144.py)|[go](./src/1144-Decrease-Elements-To-Make-Array-Zigzag/1144.go)|[js](./src/1144-Decrease-Elements-To-Make-Array-Zigzag/1144.js)|Medium|
 |1145|[Binary Tree Coloring Game](https://leetcode.com/problems/binary-tree-coloring-game/) | c | [c++](./src/1145-Binary-Tree-Coloring-Game/1145.cpp) |[python](./src/1145-Binary-Tree-Coloring-Game/1145.py)|[go](./src/1145-Binary-Tree-Coloring-Game/1145.go)|[js](./src/1145-Binary-Tree-Coloring-Game/1145.js)|Medium|
-|1146|[Snapshot Array](https://leetcode.com/problems/snapshot-array/) | c | [c++](./src/1146-Snapshot-Array/1146.cpp) |[python](./src/1146-Snapshot-Array/1146.py)|[go](./src/1146-Snapshot-Array/1146.go)|[js](./src/1146-Snapshot-Array/1146.js)|Medium|
+|1146|[Snapshot Array](https://leetcode.com/problems/snapshot-array/) | c | [c++](./src/1146-Snapshot-Array/1146.cpp) |[python](./src/1146-Snapshot-Array/1146.py)|[go](./src/1146-Snapshot-Array/1146.go)|[js](./src/1146-Snapshot-Array/1146.js)|Medium|
+|1147|[Longest Chunked Palindrome Decomposition](https://leetcode.com/problems/longest-chunked-palindrome-decomposition/) | c | [c++](./src/1147-Longest-Chunked-Palindrome-Decomposition/1147.cpp) |[python](./src/1147-Longest-Chunked-Palindrome-Decomposition/1147.py)|[go](./src/1147-Longest-Chunked-Palindrome-Decomposition/1147.go)|[js](./src/1147-Longest-Chunked-Palindrome-Decomposition/1147.js)|Hard|

src/1147-Longest-Chunked-Palindrome-Decomposition/1147.cpp

@@ -0,0 +1,14 @@
+class Solution 
+{
+public:
+    int longestDecomposition(string text) 
+    {
+        int n = text.size();
+        for (int i = 1; i <= n/2; ++i)
+        {
+            if (text.substr(0,i) == text.substr(n-i))
+                return 2 + longestDecomposition(text.substr(i,n-2*i));
+        }
+        return n == 0 ? 0 : 1;
+    }
+};

src/1147-Longest-Chunked-Palindrome-Decomposition/1147.go

@@ -0,0 +1,12 @@
+func longestDecomposition(text string) int {
+    var n = len(text);
+    for i := 1; i <= n/2; i++ {
+        if text[:i] == text[n-i:] {
+            return 2 + longestDecomposition(text[i:n-i])
+        }
+    }
+    if n == 0 {
+        return 0
+    }
+    return 1
+}

src/1147-Longest-Chunked-Palindrome-Decomposition/1147.js

@@ -0,0 +1,8 @@
+var longestDecomposition = function(text) {
+    var n = text.length;
+    for (var i = 1; i <= n/2; ++i) {
+        if (text.substr(0,i) == text.substr(n-i))
+            return 2 + longestDecomposition(text.substr(i,n-2*i));
+    }
+    return n == 0 ? 0 : 1;
+};

src/1147-Longest-Chunked-Palindrome-Decomposition/1147.py

@@ -0,0 +1,7 @@
+class Solution:
+    def longestDecomposition(self, text: str) -> int:
+        n = len(text)
+        for i in range(1, n//2 + 1):
+            if text[:i] == text[n-i:]:
+                return 2 + self.longestDecomposition(text[i:n-i])
+        return 0 if n == 0 else 1