JuniorString
Check if Binary String Has at Most One Segment of Ones
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
falseThe string has two segments of size 1.
Example 2
Input
s = "110"Output
trueThe string has one contiguous segment of ones.
Constraints
- 1 <= s.length <= 100
- s[i] is either '0' or '1'.
- s[0] is '1'.