update

leetcode-cn/originData/find-longest-subarray-lcci.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>给定一个放有字母和数字的数组，找到最长的子数组，且包含的字母和数字的个数相同。</p>\n\n<p>返回该子数组，若存在多个最长子数组，返回左端点下标值最小的子数组。若不存在这样的数组，返回一个空数组。</p>\n\n<p><strong>示例 1:</strong></p>\n\n<pre>\n<strong>输入: </strong>[\"A\",\"1\",\"B\",\"C\",\"D\",\"2\",\"3\",\"4\",\"E\",\"5\",\"F\",\"G\",\"6\",\"7\",\"H\",\"I\",\"J\",\"K\",\"L\",\"M\"]\n\n<strong>输出: </strong>[\"A\",\"1\",\"B\",\"C\",\"D\",\"2\",\"3\",\"4\",\"E\",\"5\",\"F\",\"G\",\"6\",\"7\"]\n</pre>\n\n<p><strong>示例 2:</strong></p>\n\n<pre>\n<strong>输入: </strong>[\"A\",\"A\"]\n\n<strong>输出: </strong>[]\n</pre>\n\n<p><strong>提示：</strong></p>\n\n<ul>\n\t<li><code>array.length <= 100000</code></li>\n</ul>\n",
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 46,
+            "likes": 48,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -149,7 +149,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"6.8K\", \"totalSubmission\": \"17.2K\", \"totalAcceptedRaw\": 6791, \"totalSubmissionRaw\": 17248, \"acRate\": \"39.4%\"}",
+            "stats": "{\"totalAccepted\": \"7.1K\", \"totalSubmission\": \"18K\", \"totalAcceptedRaw\": 7090, \"totalSubmissionRaw\": 17959, \"acRate\": \"39.5%\"}",
             "hints": [
                 "是哪个字母或数字并不重要。你可以把该问题简化为只包含 A 和 B 的数组。然后寻找具有相同数量的 A 和 B 的最长子数组。",
                 "从蛮力解法开始。",