Class Solution

  • All Implemented Interfaces:

    
    public final class Solution
    
                        

    1784 - Check if Binary String Has at Most One Segment of Ones\.

    Easy

    Given a binary string s without leading zeros , return true if s contains at most one contiguous segment of ones. Otherwise, return false.

    Example 1:

    Input: s = "1001"

    Output: false

    Explanation: The ones do not form a contiguous segment.

    Example 2:

    Input: s = "110"

    Output: true

    Constraints:

    • 1 <= s.length <= 100

    • s[i] is either '0' or '1'.

    • s[0] is '1'.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description
    • Field Summary

      Fields 
      Modifier and Type Field Description
    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()
    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description
    • Method Summary

      Modifier and Type Method Description
      final Boolean checkOnesSegment(String s)
      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait