solves check if binary string has at most one segment of ones

Author: anishLearnsToCode

README.md

@@ -434,7 +434,7 @@
 | 1768 | [Merge Strings Alternately](https://leetcode.com/problems/merge-strings-alternately)                                                                      |                                                             [![Java](assets/java.png)](src/MergeStringsAlternately.java)                                                             |                                                                                                                                   |
 | 1773 | [Count Items Matching a Rule](https://leetcode.com/problems/count-items-matching-a-rule)                                                                  |                                                             [![Java](assets/java.png)](src/CountItemsMatchingARule.java)                                                             |                                                                                                                                   |
 | 1779 | [Find Nearest Point That Has the Same X or Y Coordinate](https://leetcode.com/problems/find-nearest-point-that-has-the-same-x-or-y-coordinate)            |                                                  [![Java](assets/java.png)](src/FindNearestPointThatHasTheSameXOrYCoordinate.java)                                                   |                                                                                                                                   |
-| 1784 | [Check if Binary String Has at Most One Segment of Ones](https://leetcode.com/problems/check-if-binary-string-has-at-most-one-segment-of-ones)            |                                                                                                                                                                                      |                                                                                                                                   |
+| 1784 | [Check if Binary String Has at Most One Segment of Ones](https://leetcode.com/problems/check-if-binary-string-has-at-most-one-segment-of-ones)            |                                                  [![Java](assets/java.png)](src/CheckIfBinaryStringHasAtMostOneSegmentOfOnes.java)                                                   |                                                                                                                                   |
 | 1790 | [Check if One String Swap Can Make Strings Equal](https://leetcode.com/problems/check-if-one-string-swap-can-make-strings-equal)                          |                                                                                                                                                                                      |                                                                                                                                   |
 | 1791 | [Find Center of Star Graph](https://leetcode.com/problems/find-center-of-star-graph)                                                                      |                                                                                                                                                                                      |                                                                                                                                   |
 | 1796 | [Second Largest Digit in a String](https://leetcode.com/problems/second-largest-digit-in-a-string)                                                        |                                                                                                                                                                                      |                                                                                                                                   |

src/CheckIfBinaryStringHasAtMostOneSegmentOfOnes.java

@@ -0,0 +1,15 @@
+public class CheckIfBinaryStringHasAtMostOneSegmentOfOnes {
+    public boolean checkOnesSegment(String s) {
+        int segments = 0;
+        boolean isInSegment = false;
+        for (int index = 0 ; index < s.length() ; index++) {
+            if (!isInSegment && s.charAt(index) == '1') {
+                isInSegment = true;
+                segments++;
+            } else if (isInSegment && s.charAt(index) == '0') {
+                isInSegment = false;
+            }
+        }
+        return segments <= 1;
+    }
+}