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:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/largest-1-bordered-square.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 482,
"likes": 485,
"dislikes": 81,
"isLiked": null,
"similarQuestions": "[]",
@@ -131,7 +131,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"17.9K\", \"totalSubmission\": \"36.3K\", \"totalAcceptedRaw\": 17932, \"totalSubmissionRaw\": 36281, \"acRate\": \"49.4%\"}",
"stats": "{\"totalAccepted\": \"18K\", \"totalSubmission\": \"36.4K\", \"totalAcceptedRaw\": 17983, \"totalSubmissionRaw\": 36361, \"acRate\": \"49.5%\"}",
"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)."