coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-12-19 10:34:57 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 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

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"22.5K\", \"totalSubmission\": \"30.8K\", \"totalAcceptedRaw\": 22531, \"totalSubmissionRaw\": 30802, \"acRate\": \"73.1%\"}",
"stats": "{\"totalAccepted\": \"22.6K\", \"totalSubmission\": \"30.9K\", \"totalAcceptedRaw\": 22569, \"totalSubmissionRaw\": 30860, \"acRate\": \"73.1%\"}",
"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."