Given a binary string s, determine whether s contains at most $1$ contiguous segment of $'1'$s. Return True if it contains at most $1$ contiguous segment of $'1'$s, and False otherwise.

Constraints:

• $1 \leq$ s.length $\leq 100$

• s[i] is either $'0'$ or $'1'$

• s[$0$] is $'1'$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.