coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 15:31:43 +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

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

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 575,
"dislikes": 22,
"likes": 645,
"dislikes": 31,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Next Greater Element I\", \"titleSlug\": \"next-greater-element-i\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Sum of Subarray Minimums\", \"titleSlug\": \"sum-of-subarray-minimums\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Number of Visible People in a Queue\", \"titleSlug\": \"number-of-visible-people-in-a-queue\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Count Number of Homogenous Substrings\", \"titleSlug\": \"count-number-of-homogenous-substrings\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "[1,2,3]\n[1,3,3]\n[4,-2,-3,4,1]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"21.1K\", \"totalSubmission\": \"35.1K\", \"totalAcceptedRaw\": 21079, \"totalSubmissionRaw\": 35070, \"acRate\": \"60.1%\"}",
"stats": "{\"totalAccepted\": \"25K\", \"totalSubmission\": \"41.4K\", \"totalAcceptedRaw\": 25003, \"totalSubmissionRaw\": 41436, \"acRate\": \"60.3%\"}",
"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]."