check-if-binary-string-has-at-most-one-segment-of-ones

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

Given a binary string <code>s</code> ​​​​​without leading zeros, return <code>true</code>​​​ if <code>s</code> contains at most one contiguous segment of ones. Otherwise, return <code>false</code>.

&nbsp;
Example 1:

<pre>
Input: s = &quot;1001&quot;
Output: false
Explanation: The string has two segments of size 1.
</pre>

Example 2:

<pre>
Input: s = &quot;110&quot;
Output: true</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= s.length &lt;= 100</code></li>
	<li><code>s[i]</code>​​​​ is either <code>&#39;0&#39;</code> or <code>&#39;1&#39;</code>.</li>
	<li><code>s[0]</code> is&nbsp;<code>&#39;1&#39;</code>.</li>
</ul>

Weekly Contest 231

weekly-contest-231

checkOnesSegment

Mid Level

Check if Binary String Has at Most One Segment of Ones

String

Accepted

Wrong Answer

Memory Limit Exceeded

Output Limit Exceeded

Time Limit Exceeded

Runtime Error

Internal Error

Compile Error

Timeout

Restrictions Failed

cangjie

react

vanillajs