coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-02 14:12:17 +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-cn/originData/check-array-formation-through-concatenation.json
View File

@@ -143,14 +143,14 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"14.2K\", \"totalSubmission\": \"21.8K\", \"totalAcceptedRaw\": 14173, \"totalSubmissionRaw\": 21815, \"acRate\": \"65.0%\"}",
"stats": "{\"totalAccepted\": \"14.4K\", \"totalSubmission\": \"22.2K\", \"totalAcceptedRaw\": 14407, \"totalSubmissionRaw\": 22173, \"acRate\": \"65.0%\"}",
"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"
],
"solution": null,
"status": null,
"sampleTestCase": "[15,88]\n[[88],[15]]",
"sampleTestCase": "[85]\n[[85]]",
"metaData": "{\n \"name\": \"canFormArray\",\n \"params\": [\n {\n \"name\": \"arr\",\n \"type\": \"integer[]\"\n },\n {\n \"type\": \"integer[][]\",\n \"name\": \"pieces\"\n }\n ],\n \"return\": {\n \"type\": \"boolean\"\n }\n}",
"judgerAvailable": true,
"judgeType": "large",