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/largest-1-bordered-square.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"10.6K\", \"totalSubmission\": \"21.7K\", \"totalAcceptedRaw\": 10572, \"totalSubmissionRaw\": 21738, \"acRate\": \"48.6%\"}",
"stats": "{\"totalAccepted\": \"10.6K\", \"totalSubmission\": \"21.8K\", \"totalAcceptedRaw\": 10589, \"totalSubmissionRaw\": 21762, \"acRate\": \"48.7%\"}",
"hints": [
"For each square, know how many ones are up, left, down, and right of this square. You can find it in O(N^2) using dynamic programming.",
"Now for each square ( O(N^3) ), we can evaluate whether that square is 1-bordered in O(1)."