coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 23:41:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
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
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/count-square-submatrices-with-all-ones.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"33K\", \"totalSubmission\": \"44.7K\", \"totalAcceptedRaw\": 32966, \"totalSubmissionRaw\": 44744, \"acRate\": \"73.7%\"}",
"stats": "{\"totalAccepted\": \"33K\", \"totalSubmission\": \"44.7K\", \"totalAcceptedRaw\": 32968, \"totalSubmissionRaw\": 44747, \"acRate\": \"73.7%\"}",
"hints": [
"Create an additive table that counts the sum of elements of submatrix with the superior corner at (0,0).",
"Loop over all subsquares in O(n^3) and check if the sum make the whole array to be ones, if it checks then add 1 to the answer."