coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21:40 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/ways-to-split-array-into-three-subarrays.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 740,
"likes": 741,
"dislikes": 69,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Number of Ways to Divide a Long Corridor\", \"titleSlug\": \"number-of-ways-to-divide-a-long-corridor\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
@@ -137,7 +137,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"18.2K\", \"totalSubmission\": \"58.9K\", \"totalAcceptedRaw\": 18243, \"totalSubmissionRaw\": 58871, \"acRate\": \"31.0%\"}",
"stats": "{\"totalAccepted\": \"18.3K\", \"totalSubmission\": \"59K\", \"totalAcceptedRaw\": 18288, \"totalSubmissionRaw\": 59018, \"acRate\": \"31.0%\"}",
"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.",