coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-21 21:16:45 +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/ways-to-split-array-into-three-subarrays.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"7.7K\", \"totalSubmission\": \"28.8K\", \"totalAcceptedRaw\": 7675, \"totalSubmissionRaw\": 28818, \"acRate\": \"26.6%\"}",
"stats": "{\"totalAccepted\": \"7.7K\", \"totalSubmission\": \"28.9K\", \"totalAcceptedRaw\": 7682, \"totalSubmissionRaw\": 28859, \"acRate\": \"26.6%\"}",
"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.",