1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 15:31:43 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
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

View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"46.3K\", \"totalSubmission\": \"70.8K\", \"totalAcceptedRaw\": 46336, \"totalSubmissionRaw\": 70777, \"acRate\": \"65.5%\"}",
"stats": "{\"totalAccepted\": \"46.3K\", \"totalSubmission\": \"70.8K\", \"totalAcceptedRaw\": 46346, \"totalSubmissionRaw\": 70799, \"acRate\": \"65.5%\"}",
"hints": [
"Assuming a 0-indexed matrix, for a given cell on row i and column j, it is in a diagonal if and only if i == j or i == n - 1 - j.",
"We can then iterate through the elements in the matrix to check if all the elements in the diagonals are non-zero and all other elements are zero."