mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 23:11:41 +08:00
update
This commit is contained in:
@@ -11,7 +11,7 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Hard",
|
||||
"likes": 344,
|
||||
"likes": 345,
|
||||
"dislikes": 5,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Longest Increasing Subsequence\", \"titleSlug\": \"longest-increasing-subsequence\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
|
||||
@@ -149,7 +149,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"8.1K\", \"totalSubmission\": \"17.8K\", \"totalAcceptedRaw\": 8068, \"totalSubmissionRaw\": 17830, \"acRate\": \"45.2%\"}",
|
||||
"stats": "{\"totalAccepted\": \"8.1K\", \"totalSubmission\": \"17.9K\", \"totalAcceptedRaw\": 8082, \"totalSubmissionRaw\": 17859, \"acRate\": \"45.3%\"}",
|
||||
"hints": [
|
||||
"Can you keep track of the minimum height for each obstacle course length?",
|
||||
"You can use binary search to find the longest previous obstacle course length that satisfies the conditions."
|
||||
|
Reference in New Issue
Block a user