mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-07 00:11:41 +08:00
update
This commit is contained in:
@@ -52,7 +52,7 @@
|
||||
],
|
||||
"companyTagStats": null,
|
||||
"codeSnippets": null,
|
||||
"stats": "{\"totalAccepted\": \"225.3K\", \"totalSubmission\": \"390.2K\", \"totalAcceptedRaw\": 225323, \"totalSubmissionRaw\": 390162, \"acRate\": \"57.8%\"}",
|
||||
"stats": "{\"totalAccepted\": \"225.3K\", \"totalSubmission\": \"390.2K\", \"totalAcceptedRaw\": 225337, \"totalSubmissionRaw\": 390180, \"acRate\": \"57.8%\"}",
|
||||
"hints": [
|
||||
"Could you trade extra space such that <code>move()</code> operation can be done in O(1)?",
|
||||
"You need two arrays: int rows[n], int cols[n], plus two variables: diagonal, anti_diagonal."
|
||||
|
Reference in New Issue
Block a user