update

leetcode-cn/originData/majority-element.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>给定一个大小为 <em>n </em>的数组，找到其中的多数元素。多数元素是指在数组中出现次数 <strong>大于</strong> <code>⌊ n/2 ⌋</code> 的元素。</p>\n\n<p>你可以假设数组是非空的，并且给定的数组总是存在多数元素。</p>\n\n<p> </p>\n\n<p><strong>示例 1：</strong></p>\n\n<pre>\n<strong>输入：</strong>[3,2,3]\n<strong>输出：</strong>3</pre>\n\n<p><strong>示例 2：</strong></p>\n\n<pre>\n<strong>输入：</strong>[2,2,1,1,1,2,2]\n<strong>输出：</strong>2\n</pre>\n\n<p> </p>\n\n<p><strong>进阶：</strong></p>\n\n<ul>\n\t<li>尝试设计时间复杂度为 O(n)、空间复杂度为 O(1) 的算法解决此问题。</li>\n</ul>\n",
             "isPaidOnly": false,
             "difficulty": "Easy",
-            "likes": 1376,
+            "likes": 1411,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Majority Element II\", \"titleSlug\": \"majority-element-ii\", \"difficulty\": \"Medium\", \"translatedTitle\": \"\\u6c42\\u4f17\\u6570 II\"}, {\"title\": \"Check If a Number Is Majority Element in a Sorted Array\", \"titleSlug\": \"check-if-a-number-is-majority-element-in-a-sorted-array\", \"difficulty\": \"Easy\", \"translatedTitle\": \"\\u68c0\\u67e5\\u4e00\\u4e2a\\u6570\\u662f\\u5426\\u5728\\u6570\\u7ec4\\u4e2d\\u5360\\u7edd\\u5927\\u591a\\u6570\"}]",
@@ -161,7 +161,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"487.6K\", \"totalSubmission\": \"732K\", \"totalAcceptedRaw\": 487564, \"totalSubmissionRaw\": 731986, \"acRate\": \"66.6%\"}",
+            "stats": "{\"totalAccepted\": \"507.1K\", \"totalSubmission\": \"760.3K\", \"totalAcceptedRaw\": 507057, \"totalSubmissionRaw\": 760327, \"acRate\": \"66.7%\"}",
             "hints": [],
             "solution": null,
             "status": null,