Check if Binary String Has at Most One Segment of Ones
Easy
You receive a binary string s without leading zeros, provide true if s includes at most one contiguous segment of ones. Otherwise, provide false.
Example 1
Input: s = "1001"
Output: false
Explanation: The string has two segments of size 1.
Example 2
Input: s = "110"
Output: true
Constraints
1 <= s.length <= 100s[i]is either'0'or'1'.s[0]is'1'.
Did this problem appear in one of your interviews?
Responses stay private.