add 1221

fishercoder1534 · fishercoder1534 · commit dac01809971f · 2020-01-30T20:14:41.000-08:00
diff --git a/README.md b/README.md
@@ -35,6 +35,7 @@ _If you like this project, please leave me a star._ &#9733;
 |1243|[Array Transformation](https://leetcode.com/problems/array-transformation/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1243.java) |  [:tv:](https://www.youtube.com/watch?v=MQ2i4T1l-Gs)|Easy||
 |1232|[Check If It Is a Straight Line](https://leetcode.com/problems/check-if-it-is-a-straight-line/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1232.java) | [:tv:](https://www.youtube.com/watch?v=_tfiTQNZCbs)  |Easy||
 |1228|[Missing Number In Arithmetic Progression](https://leetcode.com/problems/missing-number-in-arithmetic-progression/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1228.java) |   |Easy||
+|1221|[Split a String in Balanced Strings](https://leetcode.com/problems/split-a-string-in-balanced-strings/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1221.java) | |Easy|Greedy|
 |1217|[Play with Chips](https://leetcode.com/problems/play-with-chips/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1217.java) |   |Easy||
 |1213|[Intersection of Three Sorted Arrays](https://leetcode.com/problems/intersection-of-three-sorted-arrays/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1213.java) |   [:tv:](https://www.youtube.com/watch?v=zceoOrHSHNQ)|Easy||
 |1207|[Unique Number of Occurrences](https://leetcode.com/problems/unique-number-of-occurrences/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1207.java) | [:tv:](https://www.youtube.com/watch?v=_NYimlZY1PE)|Easy||
diff --git a/src/main/java/com/fishercoder/solutions/_1221.java b/src/main/java/com/fishercoder/solutions/_1221.java
@@ -0,0 +1,57 @@
+package com.fishercoder.solutions;
+
+/**
+ * 1221. Split a String in Balanced Strings
+ *
+ * Balanced strings are those who have equal quantity of 'L' and 'R' characters.
+ * Given a balanced string s split it in the maximum amount of balanced strings.
+ * Return the maximum amount of splitted balanced strings.
+ *
+ * Example 1:
+ * Input: s = "RLRRLLRLRL"
+ * Output: 4
+ * Explanation: s can be split into "RL", "RRLL", "RL", "RL", each substring contains same number of 'L' and 'R'.
+ *
+ * Example 2:
+ * Input: s = "RLLLLRRRLR"
+ * Output: 3
+ * Explanation: s can be split into "RL", "LLLRRR", "LR", each substring contains same number of 'L' and 'R'.
+ *
+ * Example 3:
+ * Input: s = "LLLLRRRR"
+ * Output: 1
+ * Explanation: s can be split into "LLLLRRRR".
+ *
+ * Example 4:
+ * Input: s = "RLRRRLLRLL"
+ * Output: 2
+ * Explanation: s can be split into "RL", "RRRLLRLL", since each substring contains an equal number of 'L' and 'R'
+ *
+ * Constraints:
+ * 1 <= s.length <= 1000
+ * s[i] = 'L' or 'R'
+ * */
+public class _1221 {
+    public static class Solution1 {
+        public int balancedStringSplit(String s) {
+            int i = 0;
+            int balancedCount = 0;
+            int lCount = 0;
+            int rCount = 0;
+            while (i < s.length()) {
+                if (s.charAt(i) == 'L') {
+                    lCount++;
+                } else {
+                    rCount++;
+                }
+                i++;
+                if (lCount != 0 && lCount == rCount) {
+                    lCount = 0;
+                    rCount = 0;
+                    balancedCount++;
+                }
+            }
+            return balancedCount;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1221Test.java b/src/test/java/com/fishercoder/_1221Test.java
@@ -0,0 +1,37 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1221;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1221Test {
+    private static _1221.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1221.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(4, solution1.balancedStringSplit("RLRRLLRLRL"));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(3, solution1.balancedStringSplit("RLLLLRRRLR"));
+    }
+
+    @Test
+    public void test3() {
+        assertEquals(1, solution1.balancedStringSplit("LLLLRRRR"));
+    }
+
+    @Test
+    public void test4() {
+        assertEquals(2, solution1.balancedStringSplit("RLRRRLLRLL"));
+    }
+
+}
