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: 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’.

class Solution:
    def checkOnesSegment(self, s: str) -> bool:
        for i in range(1,len(s)):
            if s[i-1]=="0" and s[i]=="1":
                return False
                break
        return True

• Runtime: 20 ms, faster than 98.57% of Python3 online submissions for Check if Binary String Has at Most One Segment of Ones.
• Memory Usage: 14.1 MB, less than 90.96% of Python3 online submissions for Check if Binary String Has at Most One Segment of Ones.