mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-06 07:51:41 +08:00
update
This commit is contained in:
@@ -155,7 +155,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"63.9K\", \"totalSubmission\": \"123.7K\", \"totalAcceptedRaw\": 63876, \"totalSubmissionRaw\": 123699, \"acRate\": \"51.6%\"}",
|
||||
"stats": "{\"totalAccepted\": \"63.9K\", \"totalSubmission\": \"123.7K\", \"totalAcceptedRaw\": 63893, \"totalSubmissionRaw\": 123726, \"acRate\": \"51.6%\"}",
|
||||
"hints": [
|
||||
"Use for loops to check each row for every number from 1 to n. Similarly, do the same for each column.",
|
||||
"For each check, you can keep a set of the unique elements in the checked row/col. By the end of the check, the size of the set should be n."
|
||||
|
Reference in New Issue
Block a user