1910. Check if Binary String Has at Most One Segment of Ones
My accepted Python solution to LeetCode problem 1910, Check if Binary String Has at Most One Segment of Ones, running in 0ms.
- Difficulty: Easy
- Python
- Runtime 0ms
- Memory 17.4MB
- Updated
Read the problem on LeetCode View on GitHub
The problem statement is LeetCode’s and stays on their site. What follows is my accepted solution.
Python
Accepted on LeetCode — runtime 0ms, memory 17.4MB, accepted 2025-12-31.
class Solution:
def checkOnesSegment(self, s: str) -> bool:
return '01' not in s