mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 07:21:40 +08:00
存量题库数据更新
This commit is contained in:
@@ -11,17 +11,36 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": true,
|
||||
"difficulty": "Medium",
|
||||
"likes": 5,
|
||||
"dislikes": 1,
|
||||
"likes": 12,
|
||||
"dislikes": 5,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
"exampleTestcases": "[3,3,3,3,3]\n[1,1,1,3,9,9,9,2,10,10]\n[1,2,3,4,5,6,7]",
|
||||
"categoryTitle": "Algorithms",
|
||||
"contributors": [],
|
||||
"topicTags": [],
|
||||
"topicTags": [
|
||||
{
|
||||
"name": "Array",
|
||||
"slug": "array",
|
||||
"translatedName": null,
|
||||
"__typename": "TopicTagNode"
|
||||
},
|
||||
{
|
||||
"name": "Binary Search",
|
||||
"slug": "binary-search",
|
||||
"translatedName": null,
|
||||
"__typename": "TopicTagNode"
|
||||
},
|
||||
{
|
||||
"name": "Divide and Conquer",
|
||||
"slug": "divide-and-conquer",
|
||||
"translatedName": null,
|
||||
"__typename": "TopicTagNode"
|
||||
}
|
||||
],
|
||||
"companyTagStats": null,
|
||||
"codeSnippets": null,
|
||||
"stats": "{\"totalAccepted\": \"127\", \"totalSubmission\": \"167\", \"totalAcceptedRaw\": 127, \"totalSubmissionRaw\": 167, \"acRate\": \"76.0%\"}",
|
||||
"stats": "{\"totalAccepted\": \"1K\", \"totalSubmission\": \"1.3K\", \"totalAcceptedRaw\": 1049, \"totalSubmissionRaw\": 1340, \"acRate\": \"78.3%\"}",
|
||||
"hints": [
|
||||
"Start from the beginning of the array <code>nums.at(0)</code>.",
|
||||
"Do a binary search on the last index <code>last</code> such that <code>nums.at(0) == nums.at(last)</code>.",
|
||||
|
Reference in New Issue
Block a user