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

6
leetcode/originData/check-array-formation-through-concatenation.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 665,
"dislikes": 111,
"likes": 676,
"dislikes": 112,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[15,88]\n[[88],[15]]\n[49,18,16]\n[[16,18,49]]\n[91,4,64,78]\n[[78],[4,64],[91]]",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"66.1K\", \"totalSubmission\": \"118.6K\", \"totalAcceptedRaw\": 66134, \"totalSubmissionRaw\": 118628, \"acRate\": \"55.7%\"}",
"stats": "{\"totalAccepted\": \"67K\", \"totalSubmission\": \"120K\", \"totalAcceptedRaw\": 66963, \"totalSubmissionRaw\": 119975, \"acRate\": \"55.8%\"}",
"hints": [
"Note that the distinct part means that every position in the array belongs to only one piece",
"Note that you can get the piece every position belongs to naively"