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-plus-sign.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"56.1K\", \"totalSubmission\": \"116.3K\", \"totalAcceptedRaw\": 56077, \"totalSubmissionRaw\": 116337, \"acRate\": \"48.2%\"}",
"stats": "{\"totalAccepted\": \"56.1K\", \"totalSubmission\": \"116.3K\", \"totalAcceptedRaw\": 56078, \"totalSubmissionRaw\": 116339, \"acRate\": \"48.2%\"}",
"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."
],