coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-02 22:13:28 +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/number-of-submatrices-that-sum-to-target.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"19.6K\", \"totalSubmission\": \"29.2K\", \"totalAcceptedRaw\": 19589, \"totalSubmissionRaw\": 29247, \"acRate\": \"67.0%\"}",
"stats": "{\"totalAccepted\": \"19.8K\", \"totalSubmission\": \"29.5K\", \"totalAcceptedRaw\": 19777, \"totalSubmissionRaw\": 29516, \"acRate\": \"67.0%\"}",
"hints": [
"Using a 2D prefix sum, we can query the sum of any submatrix in O(1) time.\r\nNow for each (r1, r2), we can find the largest sum of a submatrix that uses every row in [r1, r2] in linear time using a sliding window."
],