solves split a string into balanced sub strings

Author: anishLearnsToCode

README.md

@@ -320,7 +320,7 @@
 | 1207 | [Unique Number of Occurrences](https://leetcode.com/problems/unique-number-of-occurrences)                                                           |                                                       [![Java](assets/java.png)](src/UniqueNumberOfOccurrences.java)                                                        |                                                                                                                                   |
 | 1213 | 🔒 [Intersection of Three Sorted Arrays](https://leetcode.com/problems/intersection-of-three-sorted-arrays)                                          |                                                                                                                                                                             |                                                                                                                                   |
 | 1217 | [Minimum Cost to Move Chips to The Same Position](https://leetcode.com/problems/minimum-cost-to-move-chips-to-the-same-position)                     |                                                [![Java](assets/java.png)](src/MinimumCostToMoveChipsToTheSamePosition.java)                                                 |                                                                                                                                   |
-| 1221 | [Split A String In Balanced Strings](https://leetcode.com/problems/split-a-string-in-balanced-strings)                                               |                                                                                                                                                                             |                                                                                                                                   |
+| 1221 | [Split A String In Balanced Strings](https://leetcode.com/problems/split-a-string-in-balanced-strings)                                               |                                                     [![Java](assets/java.png)](src/SplitAStringInBalancedStrings.java)                                                      |                                                                                                                                   |
 | 1228 | [Missing A Number In Arithmetic Progression](https://leetcode.com/problems/missing-number-in-arithmetic-progression)                                 |                                                                                                                                                                             |                                                                                                                                   |
 | 1232 | [Check If It Is A Straight Line](https://leetcode.com/problems/check-if-it-is-a-straight-line)                                                       |                                                                                                                                                                             |                                                                                                                                   |
 | 1237 | [Find Positive Integer Solutions for a Given Equation](https://leetcode.com/problems/find-positive-integer-solution-for-a-given-equation)            |                                                                                                                                                                             |                                                                                                                                   |

src/SplitAStringInBalancedStrings.java

@@ -0,0 +1,10 @@
+public class SplitAStringInBalancedStrings {
+    public int balancedStringSplit(String s) {
+        int balancedSubStrings = 0;
+        for (int i = 0, current = 0 ; i < s.length() ; i++) {
+            current += s.charAt(i) == 'L' ? -1 : 1;
+            if (current == 0) balancedSubStrings++;
+        }
+        return balancedSubStrings;
+    }
+}