mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 07:21:40 +08:00
update
This commit is contained in:
@@ -11,8 +11,8 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Hard",
|
||||
"likes": 3065,
|
||||
"dislikes": 32,
|
||||
"likes": 3128,
|
||||
"dislikes": 34,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Maximum Earnings From Taxi\", \"titleSlug\": \"maximum-earnings-from-taxi\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Two Best Non-Overlapping Events\", \"titleSlug\": \"two-best-non-overlapping-events\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
|
||||
"exampleTestcases": "[1,2,3,3]\n[3,4,5,6]\n[50,10,40,70]\n[1,2,3,4,6]\n[3,5,10,6,9]\n[20,20,100,70,60]\n[1,1,1]\n[2,3,4]\n[5,6,4]",
|
||||
@@ -155,7 +155,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"108.1K\", \"totalSubmission\": \"212.3K\", \"totalAcceptedRaw\": 108070, \"totalSubmissionRaw\": 212319, \"acRate\": \"50.9%\"}",
|
||||
"stats": "{\"totalAccepted\": \"111.2K\", \"totalSubmission\": \"218.5K\", \"totalAcceptedRaw\": 111185, \"totalSubmissionRaw\": 218527, \"acRate\": \"50.9%\"}",
|
||||
"hints": [
|
||||
"Think on DP.",
|
||||
"Sort the elements by starting time, then define the dp[i] as the maximum profit taking elements from the suffix starting at i.",
|
||||
|
Reference in New Issue
Block a user