1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21:40 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
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

View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 1093,
"dislikes": 189,
"likes": 1104,
"dislikes": 190,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Maximal Square\", \"titleSlug\": \"maximal-square\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "5\n[[4,2]]\n1\n[[0,0]]",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"47.8K\", \"totalSubmission\": \"98.4K\", \"totalAcceptedRaw\": 47816, \"totalSubmissionRaw\": 98434, \"acRate\": \"48.6%\"}",
"stats": "{\"totalAccepted\": \"48.2K\", \"totalSubmission\": \"99.2K\", \"totalAcceptedRaw\": 48165, \"totalSubmissionRaw\": 99155, \"acRate\": \"48.6%\"}",
"hints": [
"For each direction such as \"left\", find left[r][c] = the number of 1s you will see before a zero starting at r, c and walking left. You can find this in N^2 time with a dp. The largest plus sign at r, c is just the minimum of left[r][c], up[r][c] etc."
],