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

@@ -131,7 +131,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"23.7K\", \"totalSubmission\": \"47.3K\", \"totalAcceptedRaw\": 23739, \"totalSubmissionRaw\": 47337, \"acRate\": \"50.1%\"}",
"stats": "{\"totalAccepted\": \"23.7K\", \"totalSubmission\": \"47.3K\", \"totalAcceptedRaw\": 23740, \"totalSubmissionRaw\": 47338, \"acRate\": \"50.1%\"}",
"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)."