Class Solution
-
- All Implemented Interfaces:
public final class Solution1784 - Check if Binary String Has at Most One Segment of Ones.
Easy
Given a binary string
swithout leading zeros , returntrueifscontains at most one contiguous segment of ones. Otherwise, returnfalse.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 <= 100s[i]is either'0'or'1'.s[0]is'1'.
-
-
Constructor Summary
Constructors Constructor Description Solution()
-
Method Summary
Modifier and Type Method Description final BooleancheckOnesSegment(String s)-
-
Method Detail
-
checkOnesSegment
final Boolean checkOnesSegment(String s)
-
-
-
-