update

leetcode-cn/originData/binary-string-with-substrings-representing-1-to-n.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>给定一个二进制字符串&nbsp;<code>s</code>&nbsp;和一个正整数&nbsp;<code>n</code>，如果对于&nbsp;<code>[1, n]</code>&nbsp;范围内的每个整数，<em>其二进制表示都是&nbsp;<code>s</code> 的 <strong>子字符串</strong> ，就返回 <code>true</code>，否则返回 <code>false</code>&nbsp;</em>。</p>\n\n<p><strong>子字符串</strong>&nbsp;是字符串中连续的字符序列。</p>\n\n<p>&nbsp;</p>\n\n<p><strong>示例 1：</strong></p>\n\n<pre>\n<strong>输入：</strong>s = \"0110\", n = 3\n<strong>输出：</strong>true\n</pre>\n\n<p><strong>示例 2：</strong></p>\n\n<pre>\n<strong>输入：</strong>s = \"0110\", n = 4\n<strong>输出：</strong>false\n</pre>\n\n<p>&nbsp;</p>\n\n<p><strong>提示：</strong></p>\n\n<ul>\n\t<li><code>1 &lt;= s.length &lt;= 1000</code></li>\n\t<li><code>s[i]</code>&nbsp;不是&nbsp;<code>'0'</code>&nbsp;就是&nbsp;<code>'1'</code></li>\n\t<li><code>1 &lt;= n &lt;= 10<sup>9</sup></code></li>\n</ul>\n",
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 35,
+            "likes": 36,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -137,7 +137,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"6.1K\", \"totalSubmission\": \"10.5K\", \"totalAcceptedRaw\": 6132, \"totalSubmissionRaw\": 10546, \"acRate\": \"58.1%\"}",
+            "stats": "{\"totalAccepted\": \"6.3K\", \"totalSubmission\": \"10.8K\", \"totalAcceptedRaw\": 6261, \"totalSubmissionRaw\": 10778, \"acRate\": \"58.1%\"}",
             "hints": [
                 "We only need to check substrings of length at most 30, because 10^9 has 30 bits."
             ],