update

leetcode-cn/originData/palindrome-partitioning.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>给你一个字符串 <code>s</code>，请你将<em> </em><code>s</code><em> </em>分割成一些子串，使每个子串都是 <strong>回文串</strong> 。返回 <code>s</code> 所有可能的分割方案。</p>\n\n<p><strong>回文串</strong> 是正着读和反着读都一样的字符串。</p>\n\n<p> </p>\n\n<p><strong>示例 1：</strong></p>\n\n<pre>\n<strong>输入：</strong>s = \"aab\"\n<strong>输出：</strong>[[\"a\",\"a\",\"b\"],[\"aa\",\"b\"]]\n</pre>\n\n<p><strong>示例 2：</strong></p>\n\n<pre>\n<strong>输入：</strong>s = \"a\"\n<strong>输出：</strong>[[\"a\"]]\n</pre>\n\n<p> </p>\n\n<p><strong>提示：</strong></p>\n\n<ul>\n\t<li><code>1 <= s.length <= 16</code></li>\n\t<li><code>s</code> 仅由小写英文字母组成</li>\n</ul>\n",
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 1057,
+            "likes": 1095,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Palindrome Partitioning II\", \"titleSlug\": \"palindrome-partitioning-ii\", \"difficulty\": \"Hard\", \"translatedTitle\": \"\\u5206\\u5272\\u56de\\u6587\\u4e32 II\"}]",
@@ -149,7 +149,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"175.7K\", \"totalSubmission\": \"241.7K\", \"totalAcceptedRaw\": 175698, \"totalSubmissionRaw\": 241721, \"acRate\": \"72.7%\"}",
+            "stats": "{\"totalAccepted\": \"185.9K\", \"totalSubmission\": \"255.5K\", \"totalAcceptedRaw\": 185907, \"totalSubmissionRaw\": 255470, \"acRate\": \"72.8%\"}",
             "hints": [],
             "solution": null,
             "status": null,