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

4
leetcode/originData/number-of-submatrices-that-sum-to-target.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 1516,
"likes": 1518,
"dislikes": 37,
"isLiked": null,
"similarQuestions": "[]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"47.3K\", \"totalSubmission\": \"71.4K\", \"totalAcceptedRaw\": 47321, \"totalSubmissionRaw\": 71373, \"acRate\": \"66.3%\"}",
"stats": "{\"totalAccepted\": \"47.4K\", \"totalSubmission\": \"71.4K\", \"totalAcceptedRaw\": 47361, \"totalSubmissionRaw\": 71437, \"acRate\": \"66.3%\"}",
"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."
],