coder-xiaomo/leetcode-problemset
1
0
Fork 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

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/reshape-the-matrix.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 2082,
"likes": 2091,
"dislikes": 237,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Convert 1D Array Into 2D Array\", \"titleSlug\": \"convert-1d-array-into-2d-array\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"220.6K\", \"totalSubmission\": \"354K\", \"totalAcceptedRaw\": 220580, \"totalSubmissionRaw\": 354023, \"acRate\": \"62.3%\"}",
"stats": "{\"totalAccepted\": \"221.2K\", \"totalSubmission\": \"355.1K\", \"totalAcceptedRaw\": 221239, \"totalSubmissionRaw\": 355086, \"acRate\": \"62.3%\"}",
"hints": [
"Do you know how 2d matrix is stored in 1d memory? Try to map 2-dimensions into one.",
"M[i][j]=M[n*i+j] , where n is the number of cols. \r\nThis is the one way of converting 2-d indices into one 1-d index. \r\nNow, how will you convert 1-d index into 2-d indices?",