mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-07 08:21:41 +08:00
存量题库数据更新
This commit is contained in:
@@ -8,7 +8,7 @@
|
||||
"title": "Number of Equal Numbers Blocks",
|
||||
"titleSlug": "number-of-equal-numbers-blocks",
|
||||
"content": null,
|
||||
"translatedTitle": null,
|
||||
"translatedTitle": "包含相等值数字块的数量",
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": true,
|
||||
"difficulty": "Medium",
|
||||
@@ -18,10 +18,29 @@
|
||||
"similarQuestions": "[]",
|
||||
"contributors": [],
|
||||
"langToValidPlayground": null,
|
||||
"topicTags": [],
|
||||
"topicTags": [
|
||||
{
|
||||
"name": "Array",
|
||||
"slug": "array",
|
||||
"translatedName": "数组",
|
||||
"__typename": "TopicTagNode"
|
||||
},
|
||||
{
|
||||
"name": "Binary Search",
|
||||
"slug": "binary-search",
|
||||
"translatedName": "二分查找",
|
||||
"__typename": "TopicTagNode"
|
||||
},
|
||||
{
|
||||
"name": "Divide and Conquer",
|
||||
"slug": "divide-and-conquer",
|
||||
"translatedName": "分治",
|
||||
"__typename": "TopicTagNode"
|
||||
}
|
||||
],
|
||||
"companyTagStats": null,
|
||||
"codeSnippets": null,
|
||||
"stats": "{\"totalAccepted\": \"28\", \"totalSubmission\": \"39\", \"totalAcceptedRaw\": 28, \"totalSubmissionRaw\": 39, \"acRate\": \"71.8%\"}",
|
||||
"stats": "{\"totalAccepted\": \"72\", \"totalSubmission\": \"109\", \"totalAcceptedRaw\": 72, \"totalSubmissionRaw\": 109, \"acRate\": \"66.1%\"}",
|
||||
"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