binary-string-with-substrings-representing-1-to-n

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given a binary string <code>s</code> and a positive integer <code>n</code>, return <code>true</code> if the binary representation of all the integers in the range <code>[1, n]</code> are substrings of <code>s</code>, or <code>false</code> otherwise.

A substring is a contiguous sequence of characters within a string.

&nbsp;
Example 1:
<pre>Input: s = "0110", n = 3
Output: true
</pre>Example 2:
<pre>Input: s = "0110", n = 4
Output: false
</pre>
&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= s.length &lt;= 1000</code></li>
	<li><code>s[i]</code> is either <code>&#39;0&#39;</code> or <code>&#39;1&#39;</code>.</li>
	<li><code>1 &lt;= n &lt;= 109</code></li>
</ul>

queryString

Binary String With Substrings Representing 1 To N

String

给定一个二进制字符串&nbsp;<code>s</code>&nbsp;和一个正整数&nbsp;<code>n</code>，如果对于&nbsp;<code>[1, n]</code>&nbsp;范围内的每个整数，其二进制表示都是&nbsp;<code>s</code> 的 子字符串 ，就返回 <code>true</code>，否则返回 <code>false</code>&nbsp;。

子字符串&nbsp;是字符串中连续的字符序列。

&nbsp;

示例 1：

<pre>
输入：s = "0110", n = 3
输出：true
</pre>

示例 2：

<pre>
输入：s = "0110", n = 4
输出：false
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= s.length &lt;= 1000</code></li>
	<li><code>s[i]</code>&nbsp;不是&nbsp;<code>'0'</code>&nbsp;就是&nbsp;<code>'1'</code></li>
	<li><code>1 &lt;= n &lt;= 109</code></li>
</ul>