update

leetcode-cn/originData/permutation-in-string.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>给你两个字符串&nbsp;<code>s1</code>&nbsp;和&nbsp;<code>s2</code> ，写一个函数来判断 <code>s2</code> 是否包含 <code>s1</code><strong>&nbsp;</strong>的排列。如果是，返回 <code>true</code> ；否则，返回 <code>false</code> 。</p>\n\n<p>换句话说，<code>s1</code> 的排列之一是 <code>s2</code> 的 <strong>子串</strong> 。</p>\n\n<p>&nbsp;</p>\n\n<p><strong>示例 1：</strong></p>\n\n<pre>\n<strong>输入：</strong>s1 = \"ab\" s2 = \"eidbaooo\"\n<strong>输出：</strong>true\n<strong>解释：</strong>s2 包含 s1 的排列之一 (\"ba\").\n</pre>\n\n<p><strong>示例 2：</strong></p>\n\n<pre>\n<strong>输入：</strong>s1= \"ab\" s2 = \"eidboaoo\"\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;= s1.length, s2.length &lt;= 10<sup>4</sup></code></li>\n\t<li><code>s1</code> 和 <code>s2</code> 仅包含小写字母</li>\n</ul>\n",
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 617,
+            "likes": 651,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Minimum Window Substring\", \"titleSlug\": \"minimum-window-substring\", \"difficulty\": \"Hard\", \"translatedTitle\": \"\\u6700\\u5c0f\\u8986\\u76d6\\u5b50\\u4e32\"}, {\"title\": \"Find All Anagrams in a String\", \"titleSlug\": \"find-all-anagrams-in-a-string\", \"difficulty\": \"Medium\", \"translatedTitle\": \"\\u627e\\u5230\\u5b57\\u7b26\\u4e32\\u4e2d\\u6240\\u6709\\u5b57\\u6bcd\\u5f02\\u4f4d\\u8bcd\"}]",
@@ -155,7 +155,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"171.3K\", \"totalSubmission\": \"392.3K\", \"totalAcceptedRaw\": 171292, \"totalSubmissionRaw\": 392270, \"acRate\": \"43.7%\"}",
+            "stats": "{\"totalAccepted\": \"181.2K\", \"totalSubmission\": \"414.2K\", \"totalAcceptedRaw\": 181212, \"totalSubmissionRaw\": 414237, \"acRate\": \"43.7%\"}",
             "hints": [
                 "Obviously, brute force will result in TLE. Think of something else.",
                 "How will you check whether one string is a permutation of another string?",