add 1337

fishercoder1534 · fishercoder1534 · commit 432950baf1d5 · 2020-02-02T11:45:21.000-08:00
diff --git a/README.md b/README.md
@@ -11,6 +11,7 @@ _If you like this project, please leave me a star._ &#9733;
 |1343|[Maximum Product of Splitted Binary Tree](https://leetcode.com/problems/maximum-product-of-splitted-binary-tree/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1343.java) | |Medium||
 |1342|[Reduce Array Size to The Half](https://leetcode.com/problems/reduce-array-size-to-the-half/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1342.java) | |Medium||
 |1341|[The K Weakest Rows in a Matrix](https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1341.java) | |Easy||
+|1337|[Remove Palindromic Subsequences](https://leetcode.com/problems/remove-palindromic-subsequences/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1337.java) | |Easy|String|
 |1333|[Filter Restaurants by Vegan-Friendly, Price and Distance](https://leetcode.com/problems/filter-restaurants-by-vegan-friendly-price-and-distance/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1333.java) | |Medium||
 |1331|[Rank Transform of an Array](https://leetcode.com/problems/rank-transform-of-an-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1331.java) | |Easy||
 |1329|[Sort the Matrix Diagonally](https://leetcode.com/problems/sort-the-matrix-diagonally/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1329.java) | |Medium||
diff --git a/src/main/java/com/fishercoder/solutions/_1337.java b/src/main/java/com/fishercoder/solutions/_1337.java
@@ -0,0 +1,51 @@
+package com.fishercoder.solutions;
+
+/**
+ * 1337. Remove Palindromic Subsequences
+ *
+ * Given a string s consisting only of letters 'a' and 'b'. In a single step you can remove one palindromic subsequence from s.
+ * Return the minimum number of steps to make the given string empty.
+ * A string is a subsequence of a given string, if it is generated by deleting some characters of a given string without changing its order.
+ * A string is called palindrome if is one that reads the same backward as well as forward.
+ *
+ * Example 1:
+ * Input: s = "ababa"
+ * Output: 1
+ * Explanation: String is already palindrome
+ *
+ * Example 2:
+ * Input: s = "abb"
+ * Output: 2
+ * Explanation: "abb" -> "bb" -> "".
+ * Remove palindromic subsequence "a" then "bb".
+ *
+ * Example 3:
+ * Input: s = "baabb"
+ * Output: 2
+ * Explanation: "baabb" -> "b" -> "".
+ * Remove palindromic subsequence "baab" then "b".
+ *
+ * Example 4:
+ * Input: s = ""
+ * Output: 0
+ *
+ * Constraints:
+ * 0 <= s.length <= 1000
+ * s only consists of letters 'a' and 'b'
+ * */
+public class _1337 {
+    public static class Solution1 {
+        public int removePalindromeSub(String s) {
+            if (s.isEmpty()) {
+                return 0;
+            } else {
+                String reverse = new StringBuilder(s).reverse().toString();
+                if (s.equals(reverse)) {
+                    return 1;
+                } else {
+                    return 2;
+                }
+            }
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1337Test.java b/src/test/java/com/fishercoder/_1337Test.java
@@ -0,0 +1,37 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1337;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1337Test {
+    private static _1337.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1337.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(1, solution1.removePalindromeSub("ababa"));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(2, solution1.removePalindromeSub("abb"));
+    }
+
+    @Test
+    public void test3() {
+        assertEquals(2, solution1.removePalindromeSub("baabb"));
+    }
+
+    @Test
+    public void test4() {
+        assertEquals(0, solution1.removePalindromeSub(""));
+    }
+
+}
