Added Check if Binary String Has at Most One Segment of Ones.java

varunu28 · web-flow · commit 0cf730d40598 · 2021-03-07T05:50:59.000-08:00
diff --git a/Easy/Check if Binary String Has at Most One Segment of Ones.java b/Easy/Check if Binary String Has at Most One Segment of Ones.java
@@ -0,0 +1,23 @@
+class Solution {
+  public boolean checkOnesSegment(String s) {
+    boolean foundContiguousSegment = false;
+    int idx = 0;
+    int n = s.length();
+    while (idx < n) {
+      int count = 0;
+      while (idx < n && s.charAt(idx) == '1') {
+        count++;
+        idx++;
+      }
+      if (count >= 1) {
+        if (foundContiguousSegment) {
+          return false;
+        }
+        foundContiguousSegment = true;
+      } else {
+        idx++;
+      }
+    }
+    return foundContiguousSegment;
+  }
+}
