coder-xiaomo/leetcode-problemset
1
0
Fork 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

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

2
leetcode/originData/largest-plus-sign.json
View File

@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"47.8K\", \"totalSubmission\": \"98.4K\", \"totalAcceptedRaw\": 47787, \"totalSubmissionRaw\": 98391, \"acRate\": \"48.6%\"}",
"stats": "{\"totalAccepted\": \"47.8K\", \"totalSubmission\": \"98.4K\", \"totalAcceptedRaw\": 47816, \"totalSubmissionRaw\": 98434, \"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."
],