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

update

Browse Source
This commit is contained in:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/form-array-by-concatenating-subarrays-of-another-array.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 196,
"likes": 203,
"dislikes": 21,
"isLiked": null,
"similarQuestions": "[]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"10.1K\", \"totalSubmission\": \"19.1K\", \"totalAcceptedRaw\": 10110, \"totalSubmissionRaw\": 19080, \"acRate\": \"53.0%\"}",
"stats": "{\"totalAccepted\": \"10.3K\", \"totalSubmission\": \"19.5K\", \"totalAcceptedRaw\": 10312, \"totalSubmissionRaw\": 19461, \"acRate\": \"53.0%\"}",
"hints": [
"When we use a subarray, the room for the next subarrays will be the suffix after the used subarray.",
"If we can match a group with multiple subarrays, we should choose the first one, as this will just leave the largest room for the next subarrays."