coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-02 14:12:17 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/find-pivot-index.json
View File

@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"169.7K\", \"totalSubmission\": \"352.4K\", \"totalAcceptedRaw\": 169728, \"totalSubmissionRaw\": 352380, \"acRate\": \"48.2%\"}",
"stats": "{\"totalAccepted\": \"170.2K\", \"totalSubmission\": \"353.2K\", \"totalAcceptedRaw\": 170153, \"totalSubmissionRaw\": 353164, \"acRate\": \"48.2%\"}",
"hints": [
"We can precompute prefix sums P[i] = nums[0] + nums[1] + ... + nums[i-1].\r\nThen for each index, the left sum is P[i], and the right sum is P[P.length - 1] - P[i] - nums[i]."
],