coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-21 13:06:47 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/sum-of-subarray-ranges.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"35.1K\", \"totalSubmission\": \"55.9K\", \"totalAcceptedRaw\": 35055, \"totalSubmissionRaw\": 55864, \"acRate\": \"62.8%\"}",
"stats": "{\"totalAccepted\": \"35.1K\", \"totalSubmission\": \"55.9K\", \"totalAcceptedRaw\": 35095, \"totalSubmissionRaw\": 55927, \"acRate\": \"62.8%\"}",
"hints": [
"Can you get the max/min of a certain subarray by using the max/min of a smaller subarray within it?",
"Notice that the max of the subarray from index i to j is equal to max of (max of the subarray from index i to j-1) and nums[j]."