update

leetcode-cn/originData/palindrome-partitioning-ii.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>给你一个字符串 <code>s</code>，请你将 <code>s</code> 分割成一些子串，使每个子串都是回文。</p>\n\n<p>返回符合要求的 <strong>最少分割次数</strong> 。</p>\n\n<div class=\"original__bRMd\">\n<div>\n<p> </p>\n\n<p><strong>示例 1：</strong></p>\n\n<pre>\n<strong>输入：</strong>s = \"aab\"\n<strong>输出：</strong>1\n<strong>解释：</strong>只需一次分割就可将 <em>s </em>分割成 [\"aa\",\"b\"] 这样两个回文子串。\n</pre>\n\n<p><strong>示例 2：</strong></p>\n\n<pre>\n<strong>输入：</strong>s = \"a\"\n<strong>输出：</strong>0\n</pre>\n\n<p><strong>示例 3：</strong></p>\n\n<pre>\n<strong>输入：</strong>s = \"ab\"\n<strong>输出：</strong>1\n</pre>\n\n<p> </p>\n\n<p><strong>提示：</strong></p>\n\n<ul>\n\t<li><code>1 <= s.length <= 2000</code></li>\n\t<li><code>s</code> 仅由小写英文字母组成</li>\n</ul>\n</div>\n</div>\n",
             "isPaidOnly": false,
             "difficulty": "Hard",
-            "likes": 550,
+            "likes": 564,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Palindrome Partitioning\", \"titleSlug\": \"palindrome-partitioning\", \"difficulty\": \"Medium\", \"translatedTitle\": \"\\u5206\\u5272\\u56de\\u6587\\u4e32\"}]",
@@ -143,7 +143,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"56.5K\", \"totalSubmission\": \"114.3K\", \"totalAcceptedRaw\": 56490, \"totalSubmissionRaw\": 114331, \"acRate\": \"49.4%\"}",
+            "stats": "{\"totalAccepted\": \"58.2K\", \"totalSubmission\": \"117.6K\", \"totalAcceptedRaw\": 58168, \"totalSubmissionRaw\": 117640, \"acRate\": \"49.4%\"}",
             "hints": [],
             "solution": null,
             "status": null,