update

leetcode-cn/originData/replace-the-substring-for-balanced-string.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>有一个只含有&nbsp;<code>&#39;Q&#39;, &#39;W&#39;, &#39;E&#39;,&nbsp;&#39;R&#39;</code>&nbsp;四种字符，且长度为 <code>n</code>&nbsp;的字符串。</p>\n\n<p>假如在该字符串中，这四个字符都恰好出现&nbsp;<code>n/4</code>&nbsp;次，那么它就是一个「平衡字符串」。</p>\n\n<p>&nbsp;</p>\n\n<p>给你一个这样的字符串 <code>s</code>，请通过「替换一个子串」的方式，使原字符串 <code>s</code> 变成一个「平衡字符串」。</p>\n\n<p>你可以用和「待替换子串」长度相同的&nbsp;<strong>任何</strong> 其他字符串来完成替换。</p>\n\n<p>请返回待替换子串的最小可能长度。</p>\n\n<p>如果原字符串自身就是一个平衡字符串，则返回 <code>0</code>。</p>\n\n<p>&nbsp;</p>\n\n<p><strong>示例 1：</strong></p>\n\n<pre><strong>输入：</strong>s = &quot;QWER&quot;\n<strong>输出：</strong>0\n<strong>解释：</strong>s 已经是平衡的了。</pre>\n\n<p><strong>示例 2：</strong></p>\n\n<pre><strong>输入：</strong>s = &quot;QQWE&quot;\n<strong>输出：</strong>1\n<strong>解释：</strong>我们需要把一个 &#39;Q&#39; 替换成 &#39;R&#39;，这样得到的 &quot;RQWE&quot; (或 &quot;QRWE&quot;) 是平衡的。\n</pre>\n\n<p><strong>示例 3：</strong></p>\n\n<pre><strong>输入：</strong>s = &quot;QQQW&quot;\n<strong>输出：</strong>2\n<strong>解释：</strong>我们可以把前面的 &quot;QQ&quot; 替换成 &quot;ER&quot;。 \n</pre>\n\n<p><strong>示例 4：</strong></p>\n\n<pre><strong>输入：</strong>s = &quot;QQQQ&quot;\n<strong>输出：</strong>3\n<strong>解释：</strong>我们可以替换后 3 个 &#39;Q&#39;，使 s = &quot;QWER&quot;。\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;= 10^5</code></li>\n\t<li><code>s.length</code>&nbsp;是&nbsp;<code>4</code>&nbsp;的倍数</li>\n\t<li><code>s</code>&nbsp;中只含有&nbsp;<code>&#39;Q&#39;</code>, <code>&#39;W&#39;</code>, <code>&#39;E&#39;</code>,&nbsp;<code>&#39;R&#39;</code>&nbsp;四种字符</li>\n</ul>\n",
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 81,
+            "likes": 83,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -143,7 +143,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"6.8K\", \"totalSubmission\": \"19.4K\", \"totalAcceptedRaw\": 6771, \"totalSubmissionRaw\": 19367, \"acRate\": \"35.0%\"}",
+            "stats": "{\"totalAccepted\": \"6.9K\", \"totalSubmission\": \"19.9K\", \"totalAcceptedRaw\": 6944, \"totalSubmissionRaw\": 19882, \"acRate\": \"34.9%\"}",
             "hints": [
                 "Use 2-pointers algorithm to make sure all amount of characters outside the 2 pointers are smaller or equal to n/4.",
                 "That means you need to count the amount of each letter and make sure the amount is enough."