carloscn / carloscn/structstudy
leetcode1784:Check if Binary String Has at Most One Segment of Ones
Open
Lang-rust
Level-easy
一般问题
字符串
查找
- Dominant language
- C
- Stars
- 4
- Forks
- 1
- PR merge metrics
- No merged PRs in 30d
Description
### Describe
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'.
Contributor guide
No contributing guide indexed for this repository
Assessment
This issue has not been assessed yet.