coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-12-18 10:04:58 +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

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

@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"4.8K\", \"totalSubmission\": \"9.6K\", \"totalAcceptedRaw\": 4786, \"totalSubmissionRaw\": 9570, \"acRate\": \"50.0%\"}",
"stats": "{\"totalAccepted\": \"4.9K\", \"totalSubmission\": \"9.9K\", \"totalAcceptedRaw\": 4940, \"totalSubmissionRaw\": 9929, \"acRate\": \"49.8%\"}",
"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."
],