mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 06:51:41 +08:00
update
This commit is contained in:
@@ -11,7 +11,7 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Easy",
|
||||
"likes": 270,
|
||||
"likes": 273,
|
||||
"dislikes": 19,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Reshape the Matrix\", \"titleSlug\": \"reshape-the-matrix\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
|
||||
@@ -149,7 +149,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"27.1K\", \"totalSubmission\": \"45.6K\", \"totalAcceptedRaw\": 27150, \"totalSubmissionRaw\": 45568, \"acRate\": \"59.6%\"}",
|
||||
"stats": "{\"totalAccepted\": \"27.4K\", \"totalSubmission\": \"46K\", \"totalAcceptedRaw\": 27383, \"totalSubmissionRaw\": 46011, \"acRate\": \"59.5%\"}",
|
||||
"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",
|
||||
|
Reference in New Issue
Block a user