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

update

Browse Source
This commit is contained in:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 485,
"dislikes": 81,
"likes": 494,
"dislikes": 83,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[[1,1,1],[1,0,1],[1,1,1]]\n[[1,1,0,0]]",
@@ -131,7 +131,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"18K\", \"totalSubmission\": \"36.4K\", \"totalAcceptedRaw\": 17983, \"totalSubmissionRaw\": 36361, \"acRate\": \"49.5%\"}",
"stats": "{\"totalAccepted\": \"18.2K\", \"totalSubmission\": \"36.8K\", \"totalAcceptedRaw\": 18222, \"totalSubmissionRaw\": 36770, \"acRate\": \"49.6%\"}",
"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)."