coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 23:41: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/originData/find-the-pivot-integer.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"52.9K\", \"totalSubmission\": \"66.1K\", \"totalAcceptedRaw\": 52860, \"totalSubmissionRaw\": 66117, \"acRate\": \"79.9%\"}",
"stats": "{\"totalAccepted\": \"52.9K\", \"totalSubmission\": \"66.2K\", \"totalAcceptedRaw\": 52935, \"totalSubmissionRaw\": 66239, \"acRate\": \"79.9%\"}",
"hints": [
"Can you use brute force to check every number from 1 to n if any of them is the pivot integer?",
"If you know the sum of [1: pivot], how can you efficiently calculate the sum of the other parts?"