1784.check-if-binary-string-has-at-most-one-segment-of-ones.py

#
# @lc app=leetcode id=1784 lang=python3
#
# [1784] Check if Binary String Has at Most One Segment of Ones
#

# @lc code=start


class Solution:
    # 28 ms, 88.60%. Time: O(N). Space: O(1)
    def checkOnesSegment(self, s: str) -> bool:
        return "01" not in s

# @lc code=end