mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 07:21:40 +08:00
update
This commit is contained in:
@@ -149,7 +149,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"241K\", \"totalSubmission\": \"496.4K\", \"totalAcceptedRaw\": 240983, \"totalSubmissionRaw\": 496353, \"acRate\": \"48.6%\"}",
|
||||
"stats": "{\"totalAccepted\": \"241.9K\", \"totalSubmission\": \"498.2K\", \"totalAcceptedRaw\": 241884, \"totalSubmissionRaw\": 498180, \"acRate\": \"48.6%\"}",
|
||||
"hints": [
|
||||
"Well for some problems, the best way really is to come up with some algorithms for simulation. Basically, you need to simulate what the problem asks us to do.",
|
||||
"We go boundary by boundary and move inwards. That is the essential operation. First row, last column, last row, first column and then we move inwards by 1 and then repeat. That's all, that is all the simulation that we need.",
|
||||
|
Reference in New Issue
Block a user