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-cn/originData/ways-to-split-array-into-three-subarrays.json
View File

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"13.5K\", \"totalSubmission\": \"47K\", \"totalAcceptedRaw\": 13515, \"totalSubmissionRaw\": 46984, \"acRate\": \"28.8%\"}",
"stats": "{\"totalAccepted\": \"13.5K\", \"totalSubmission\": \"47K\", \"totalAcceptedRaw\": 13516, \"totalSubmissionRaw\": 46991, \"acRate\": \"28.8%\"}",
"hints": [
"Create a prefix array to efficiently find the sum of subarrays.",
"As we are dividing the array into three subarrays, there are two \"walls\". Iterate over the right wall positions and find where the left wall could be for each right wall position.",