leetcode1784:Check if Binary String Has at Most One Segment of Ones

[carloscn]

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'.

[carloscn]

analysis

pub fn check_ones_segment(s: &str) -> bool
{
    return s.contains("11");
}

[carloscn]

code

https://review.gerrithub.io/c/carloscn/structstudy/+/556849 https://github.com/carloscn/structstudy/commit/d02f0b6f14693367ba34b482dedf29bc6404dcc3