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/originData/number-of-ways-to-split-array.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"33.6K\", \"totalSubmission\": \"71.9K\", \"totalAcceptedRaw\": 33592, \"totalSubmissionRaw\": 71911, \"acRate\": \"46.7%\"}",
"stats": "{\"totalAccepted\": \"33.6K\", \"totalSubmission\": \"72K\", \"totalAcceptedRaw\": 33604, \"totalSubmissionRaw\": 71968, \"acRate\": \"46.7%\"}",
"hints": [
"For any index i, how can we find the sum of the first (i+1) elements from the sum of the first i elements?",
"If the total sum of the array is known, how can we check if the sum of the first (i+1) elements greater than or equal to the remaining elements?"