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/number-of-submatrices-that-sum-to-target.json
View File

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"90.5K\", \"totalSubmission\": \"130.1K\", \"totalAcceptedRaw\": 90527, \"totalSubmissionRaw\": 130054, \"acRate\": \"69.6%\"}",
"stats": "{\"totalAccepted\": \"90.5K\", \"totalSubmission\": \"130.1K\", \"totalAcceptedRaw\": 90530, \"totalSubmissionRaw\": 130057, \"acRate\": \"69.6%\"}",
"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."
],