update

leetcode-cn/originData/longest-consecutive-sequence.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>给定一个未排序的整数数组 <code>nums</code> ，找出数字连续的最长序列（不要求序列元素在原数组中连续）的长度。</p>\n\n<p>请你设计并实现时间复杂度为 <code>O(n)</code><em> </em>的算法解决此问题。</p>\n\n<p> </p>\n\n<p><strong>示例 1：</strong></p>\n\n<pre>\n<strong>输入：</strong>nums = [100,4,200,1,3,2]\n<strong>输出：</strong>4\n<strong>解释：</strong>最长数字连续序列是 <code>[1, 2, 3, 4]。它的长度为 4。</code></pre>\n\n<p><strong>示例 2：</strong></p>\n\n<pre>\n<strong>输入：</strong>nums = [0,3,7,2,5,8,4,6,0,1]\n<strong>输出：</strong>9\n</pre>\n\n<p> </p>\n\n<p><strong>提示：</strong></p>\n\n<ul>\n\t<li><code>0 <= nums.length <= 10<sup>5</sup></code></li>\n\t<li><code>-10<sup>9</sup> <= nums[i] <= 10<sup>9</sup></code></li>\n</ul>\n",
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 1184,
+            "likes": 1187,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Binary Tree Longest Consecutive Sequence\", \"titleSlug\": \"binary-tree-longest-consecutive-sequence\", \"difficulty\": \"Medium\", \"translatedTitle\": \"\\u4e8c\\u53c9\\u6811\\u6700\\u957f\\u8fde\\u7eed\\u5e8f\\u5217\"}]",
@@ -149,7 +149,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"236.3K\", \"totalSubmission\": \"431.1K\", \"totalAcceptedRaw\": 236314, \"totalSubmissionRaw\": 431104, \"acRate\": \"54.8%\"}",
+            "stats": "{\"totalAccepted\": \"237.5K\", \"totalSubmission\": \"433.5K\", \"totalAcceptedRaw\": 237536, \"totalSubmissionRaw\": 433457, \"acRate\": \"54.8%\"}",
             "hints": [],
             "solution": null,
             "status": null,