#1784

Check if Binary String Has at Most One Segment of Ones

pupil · 520 · lc easy +28 · verified · 48.5% accepted · 637 likes · top 34%

Description

Given a binary string s without leading zeros, return true if all '1' characters form a single contiguous run.

Example 1:

Input: s = "1001"
Output: false
Explanation: The ones do not form a contiguous segment.

Example 2:

Input: s = "110"
Output: true

Code

1
2
3