feat: add solutions to lc problem: No.1332. Remove Palindromic

Subsequences

Author: yanglbme

solution/1300-1399/1332.Remove Palindromic Subsequences/README.md

@@ -54,27 +54,85 @@
 	<li><code>s</code> 仅包含字母&nbsp;&#39;a&#39;&nbsp; 和 &#39;b&#39;</li>
 </ul>
 
-
 ## 解法
 
 <!-- 这里可写通用的实现逻辑 -->
 
+- 如果字符串 s 是个空串，直接返回 0。
+- 如果字符串 s 本身是个回文串，那么只需要删除 1 次。
+- 如果字符串 s 不是个回文串，我们注意到 s 最多只有两种字母 "a", "b"，并且删除的是一个子序列，因此可以先删除所有字母 "a" (`"aaa...aaa"` 是个回文串)，再删除所有字母 "b"，即可使得字符串变为空。因此需要的删除次数是 2 次。
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def removePalindromeSub(self, s: str) -> int:
+        if not s:
+            return 0
+        if s[::-1] == s:
+            return 1
+        return 2
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public int removePalindromeSub(String s) {
+        if (s.length() == 0) {
+            return 0;
+        }
+        if (new StringBuilder(s).reverse().toString().equals(s)) {
+            return 1;
+        }
+        return 2;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int removePalindromeSub(string s) {
+        if (s.empty())
+            return 0;
+        string t = s;
+        reverse(s.begin(), s.end());
+        if (s == t)
+            return 1;
+        return 2;
+    }
+};
+```
 
+### **Go**
+
+```go
+func removePalindromeSub(s string) int {
+	if len(s) == 0 {
+		return 0
+	}
+	if s == reverse(s) {
+		return 1
+	}
+	return 2
+}
+
+func reverse(s string) string {
+	r := []byte(s)
+	for i, j := 0, len(r)-1; i < j; i, j = i+1, j-1 {
+		r[i], r[j] = r[j], r[i]
+	}
+	return string(r)
+}
 ```
 
 ### **...**

solution/1300-1399/1332.Remove Palindromic Subsequences/README_EN.md

@@ -55,13 +55,68 @@ Remove palindromic subsequence "baab" then "b".
 ### **Python3**
 
 ```python
-
+class Solution:
+    def removePalindromeSub(self, s: str) -> int:
+        if not s:
+            return 0
+        if s[::-1] == s:
+            return 1
+        return 2
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public int removePalindromeSub(String s) {
+        if (s.length() == 0) {
+            return 0;
+        }
+        if (new StringBuilder(s).reverse().toString().equals(s)) {
+            return 1;
+        }
+        return 2;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int removePalindromeSub(string s) {
+        if (s.empty())
+            return 0;
+        string t = s;
+        reverse(s.begin(), s.end());
+        if (s == t)
+            return 1;
+        return 2;
+    }
+};
+```
 
+### **Go**
+
+```go
+func removePalindromeSub(s string) int {
+	if len(s) == 0 {
+		return 0
+	}
+	if s == reverse(s) {
+		return 1
+	}
+	return 2
+}
+
+func reverse(s string) string {
+	r := []byte(s)
+	for i, j := 0, len(r)-1; i < j; i, j = i+1, j-1 {
+		r[i], r[j] = r[j], r[i]
+	}
+	return string(r)
+}
 ```
 
 ### **...**

solution/1300-1399/1332.Remove Palindromic Subsequences/Solution.cpp

@@ -0,0 +1,12 @@
+class Solution {
+public:
+    int removePalindromeSub(string s) {
+        if (s.empty())
+            return 0;
+        string t = s;
+        reverse(s.begin(), s.end());
+        if (s == t)
+            return 1;
+        return 2;
+    }
+};

solution/1300-1399/1332.Remove Palindromic Subsequences/Solution.go

@@ -0,0 +1,17 @@
+func removePalindromeSub(s string) int {
+	if len(s) == 0 {
+		return 0
+	}
+	if s == reverse(s) {
+		return 1
+	}
+	return 2
+}
+
+func reverse(s string) string {
+	r := []byte(s)
+	for i, j := 0, len(r)-1; i < j; i, j = i+1, j-1 {
+		r[i], r[j] = r[j], r[i]
+	}
+	return string(r)
+}

solution/1300-1399/1332.Remove Palindromic Subsequences/Solution.java

@@ -0,0 +1,11 @@
+class Solution {
+    public int removePalindromeSub(String s) {
+        if (s.length() == 0) {
+            return 0;
+        }
+        if (new StringBuilder(s).reverse().toString().equals(s)) {
+            return 1;
+        }
+        return 2;
+    }
+}

solution/1300-1399/1332.Remove Palindromic Subsequences/Solution.py

@@ -0,0 +1,7 @@
+class Solution:
+    def removePalindromeSub(self, s: str) -> int:
+        if not s:
+            return 0
+        if s[::-1] == s:
+            return 1
+        return 2