1332 solved.

liuyubobobo · liuyubobobo · commit e95b51bc78c8 · 2020-02-21T23:35:28.000-08:00
diff --git a/1332-Remove-Palindromic-Subsequences/cpp-1332/CMakeLists.txt b/1332-Remove-Palindromic-Subsequences/cpp-1332/CMakeLists.txt
@@ -0,0 +1,6 @@
+cmake_minimum_required(VERSION 3.15)
+project(cpp_1332)
+
+set(CMAKE_CXX_STANDARD 14)
+
+add_executable(cpp_1332 main.cpp)
diff --git a/1332-Remove-Palindromic-Subsequences/cpp-1332/main.cpp b/1332-Remove-Palindromic-Subsequences/cpp-1332/main.cpp
@@ -0,0 +1,34 @@
+/// Source : https://leetcode.com/problems/remove-palindromic-subsequences/
+/// Author : liuyubobobo
+/// Time   : 2020-02-21
+
+#include <iostream>
+
+using namespace std;
+
+
+/// Mathematics
+/// Time Complexity: O(n)
+/// Space Complexity: O(1)
+class Solution {
+public:
+    int removePalindromeSub(string s) {
+
+        if(s == "") return 0;
+        return isPalindrome(s) ? 1 : 2;
+    }
+
+private:
+    bool isPalindrome(const string& s){
+
+        for(int i = 0, j = s.size() - 1; i < j; i ++, j --)
+            if(s[i] != s[j]) return false;
+        return true;
+    }
+};
+
+
+int main() {
+
+    return 0;
+}
diff --git a/readme.md b/readme.md
@@ -912,6 +912,8 @@ email: [liuyubobobo@gmail.com](mailto:liuyubobobo@gmail.com)
 | 1318 | [Minimum Flips to Make a OR b Equal to c](https://leetcode.com/problems/minimum-flips-to-make-a-or-b-equal-to-c/) | [无] | [C++](1318-Minimum-Flips-to-Make-a-OR-b-Equal-to-c/cpp-1318/) | | |
 | 1319 | [Number of Operations to Make Network Connected](https://leetcode.com/problems/number-of-operations-to-make-network-connected/) | [无] | [C++](1319-Number-of-Operations-to-Make-Network-Connected/cpp-1319/) | | |
 | | | | | | |
+| 1332 | [Remove Palindromic Subsequences](https://leetcode.com/problems/remove-palindromic-subsequences/) | [solution](https://leetcode.com/problems/remove-palindromic-subsequences/solution/) | [C++](1332-Remove-Palindromic-Subsequences/cpp-1332/) | | |
+| | | | | | |
 | 1337 | [The K Weakest Rows in a Matrix](https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix/) | [无] | [C++](1337-The-K-Weakest-Rows-in-a-Matrix/cpp-1337/) | | |
 | 1338 | [Reduce Array Size to The Half](https://leetcode.com/problems/reduce-array-size-to-the-half/) | [无] | [C++](1338-Reduce-Array-Size-to-The-Half/cpp-1338/) | | |
 | 1339 | [Maximum Product of Splitted Binary Tree](https://leetcode.com/problems/maximum-product-of-splitted-binary-tree/) | [无] | [C++](1339-Maximum-Product-of-Splitted-Binary-Tree/cpp-1339/) | | |
