update

leetcode-cn/originData/reverse-substrings-between-each-pair-of-parentheses.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>给出一个字符串 <code>s</code>（仅含有小写英文字母和括号）。</p>\n\n<p>请你按照从括号内到外的顺序，逐层反转每对匹配括号中的字符串，并返回最终的结果。</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 = \"(abcd)\"\n<strong>输出：</strong>\"dcba\"\n</pre>\n\n<p><strong>示例 2：</strong></p>\n\n<pre>\n<strong>输入：</strong>s = \"(u(love)i)\"\n<strong>输出：</strong>\"iloveu\"\n<strong>解释：</strong>先反转子字符串 \"love\" ，然后反转整个字符串。</pre>\n\n<p><strong>示例 3：</strong></p>\n\n<pre>\n<strong>输入：</strong>s = \"(ed(et(oc))el)\"\n<strong>输出：</strong>\"leetcode\"\n<strong>解释：</strong>先反转子字符串 \"oc\" ，接着反转 \"etco\" ，然后反转整个字符串。</pre>\n\n<p><strong>示例 4：</strong></p>\n\n<pre>\n<strong>输入：</strong>s = \"a(bcdefghijkl(mno)p)q\"\n<strong>输出：</strong>\"apmnolkjihgfedcbq\"\n</pre>\n\n<p> </p>\n\n<p><strong>提示：</strong></p>\n\n<ul>\n\t<li><code>0 <= s.length <= 2000</code></li>\n\t<li><code>s</code> 中只有小写英文字母和括号</li>\n\t<li>题目测试用例确保所有括号都是成对出现的</li>\n</ul>\n",
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 226,
+            "likes": 228,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -143,7 +143,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"49.1K\", \"totalSubmission\": \"75.6K\", \"totalAcceptedRaw\": 49128, \"totalSubmissionRaw\": 75608, \"acRate\": \"65.0%\"}",
+            "stats": "{\"totalAccepted\": \"50.1K\", \"totalSubmission\": \"77.2K\", \"totalAcceptedRaw\": 50086, \"totalSubmissionRaw\": 77211, \"acRate\": \"64.9%\"}",
             "hints": [
                 "Find all brackets in the string.",
                 "Does the order of the reverse matter ?",