coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 23:41:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/reshape-the-matrix.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"152.2K\", \"totalSubmission\": \"235.5K\", \"totalAcceptedRaw\": 152224, \"totalSubmissionRaw\": 235503, \"acRate\": \"64.6%\"}",
"stats": "{\"totalAccepted\": \"152.2K\", \"totalSubmission\": \"235.5K\", \"totalAcceptedRaw\": 152231, \"totalSubmissionRaw\": 235516, \"acRate\": \"64.6%\"}",
"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?",