1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 06:51:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
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

View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 273,
"dislikes": 19,
"likes": 296,
"dislikes": 20,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Reshape the Matrix\", \"titleSlug\": \"reshape-the-matrix\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
"exampleTestcases": "[1,2,3,4]\n2\n2\n[1,2,3]\n1\n3\n[1,2]\n1\n1",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"27.4K\", \"totalSubmission\": \"46K\", \"totalAcceptedRaw\": 27383, \"totalSubmissionRaw\": 46011, \"acRate\": \"59.5%\"}",
"stats": "{\"totalAccepted\": \"29.9K\", \"totalSubmission\": \"50.6K\", \"totalAcceptedRaw\": 29887, \"totalSubmissionRaw\": 50610, \"acRate\": \"59.1%\"}",
"hints": [
"When is it possible to convert original into a 2D array and when is it impossible?",
"It is possible if and only if m * n == original.length",