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/missing-number-lcci.json
View File

@@ -167,7 +167,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"58.5K\", \"totalSubmission\": \"100.3K\", \"totalAcceptedRaw\": 58462, \"totalSubmissionRaw\": 100307, \"acRate\": \"58.3%\"}",
"stats": "{\"totalAccepted\": \"58.5K\", \"totalSubmission\": \"100.3K\", \"totalAcceptedRaw\": 58482, \"totalSubmissionRaw\": 100336, \"acRate\": \"58.3%\"}",
"hints": [
"你需要多长时间才能算出缺失数字的最小有效位?",
"要找到缺失的数字中的最小有效位，你其实知道有多少个 0 和 1。例如，如果你看到最小有效位有 3 个 0 和 3 个 1，那么缺失的数字的最小值必定是 1。想想看:在任何 0 和 1 的序列中，你会得到 0，然后是 1，然后又是 0，然后又是 1，以此类推。",