mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-06 07:51:41 +08:00
update
This commit is contained in:
@@ -149,7 +149,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"96K\", \"totalSubmission\": \"143.4K\", \"totalAcceptedRaw\": 96006, \"totalSubmissionRaw\": 143440, \"acRate\": \"66.9%\"}",
|
||||
"stats": "{\"totalAccepted\": \"96.5K\", \"totalSubmission\": \"144.2K\", \"totalAcceptedRaw\": 96493, \"totalSubmissionRaw\": 144222, \"acRate\": \"66.9%\"}",
|
||||
"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?",
|
||||
|
Reference in New Issue
Block a user