coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 07:51:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/find-majority-element-lcci.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"79.1K\", \"totalSubmission\": \"141.2K\", \"totalAcceptedRaw\": 79118, \"totalSubmissionRaw\": 141167, \"acRate\": \"56.0%\"}",
"stats": "{\"totalAccepted\": \"79.1K\", \"totalSubmission\": \"141.2K\", \"totalAcceptedRaw\": 79119, \"totalSubmissionRaw\": 141168, \"acRate\": \"56.0%\"}",
"hints": [
"从蛮力解法开始。你能检查一下每个值是否为主要元素吗?",
"考虑蛮力解法。我们选择一个元素，然后通过计算匹配和非匹配元素的数量来验证它是否是主要元素。假设对于第一个元素，前几次检查显示 7 个不匹配的元素和 3 个匹配的元素。有必要继续检查这个元素吗?",