Given a binary string
s without leading zeros, return
s contains at most one contiguous segment of ones. Otherwise, return
Input: s = "1001" Output: false Explanation: The ones do not form a contiguous segment.
Input: s = "110" Output: true
1 <= s.length <= 100
s[i] is either
Count ones as segments and check how many segments we got from the string
class Solution: def checkOnesSegment(self, s: str) -> bool: segments =  start = None end = None for i, c in enumerate(s): print (start) if c == '1': if start == None: start = i end = i else: end = i else: if start != None and end != None: segments.append([start, end]) start = None end = None if start != None and end != None: segments.append([start, end]) return len(segments) == 1
- Time Complexity: O(N).
- Space Complexity: O(N).