add 1717

fishercoder1534 · fishercoder1534 · commit 69c86ebb0f88 · 2021-01-10T11:14: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;
 |1721|[Swapping Nodes in a Linked List](https://leetcode.com/problems/swapping-nodes-in-a-linked-list/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1721.java) ||Medium|LinkedList|
 |1720|[Decode XORed Array](https://leetcode.com/problems/decode-xored-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1720.java) ||Easy|Bit Manipulation|
 |1718|[Construct the Lexicographically Largest Valid Sequence](https://leetcode.com/problems/construct-the-lexicographically-largest-valid-sequence/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1718.java) ||Medium|Backtracking, Recursion|
+|1717|[Maximum Score From Removing Substrings](https://leetcode.com/problems/maximum-score-from-removing-substrings/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1717.java) ||Medium|Greedy|
 |1716|[Calculate Money in Leetcode Bank](https://leetcode.com/problems/calculate-money-in-leetcode-bank/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1716.java) ||Easy|Math, Greedy|
 |1711|[Count Good Meals](https://leetcode.com/problems/count-good-meals/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1711.java) ||Medium|Array, HashTable, Two Pointers|
 |1710|[Maximum Units on a Truck](https://leetcode.com/problems/maximum-units-on-a-truck/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1710.java) ||Easy|Greedy, Sort|
diff --git a/src/main/java/com/fishercoder/solutions/_1717.java b/src/main/java/com/fishercoder/solutions/_1717.java
@@ -0,0 +1,36 @@
+package com.fishercoder.solutions;
+
+import java.util.Stack;
+
+public class _1717 {
+    public static class Solution1 {
+        public int maximumGain(String s, int x, int y) {
+            Stack<Character> stack1 = new Stack<>();
+            int big = x > y ? x : y;
+            int small = big == x ? y : x;
+            char first = x == big ? 'a' : 'b';
+            char second = first == 'a' ? 'b' : 'a';
+            int maximumGain = 0;
+            for (char c : s.toCharArray()) {
+                if (c == second && !stack1.isEmpty() && stack1.peek() == first) {
+                    stack1.pop();
+                    maximumGain += big;
+                } else {
+                    stack1.push(c);
+                }
+            }
+            Stack<Character> stack2 = new Stack<>();
+            while (!stack1.isEmpty()) {
+                char c = stack1.pop();
+                if (c == second && !stack2.isEmpty() && stack2.peek() == first) {
+                    stack2.pop();
+                    maximumGain += small;
+                } else {
+                    stack2.push(c);
+                }
+            }
+            return maximumGain;
+        }
+    }
+
+}
diff --git a/src/test/java/com/fishercoder/_1717Test.java b/src/test/java/com/fishercoder/_1717Test.java
@@ -0,0 +1,27 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1717;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1717Test {
+    private static _1717.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1717.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(19, solution1.maximumGain("cdbcbbaaabab", 4, 5));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(20, solution1.maximumGain("aabbaaxybbaabb", 5, 4));
+    }
+
+}
