mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 06:51:41 +08:00
update
This commit is contained in:
@@ -11,8 +11,8 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Medium",
|
||||
"likes": 4762,
|
||||
"dislikes": 511,
|
||||
"likes": 4798,
|
||||
"dislikes": 514,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Count of Smaller Numbers After Self\", \"titleSlug\": \"count-of-smaller-numbers-after-self\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
|
||||
"exampleTestcases": "[[7,0],[4,4],[7,1],[5,0],[6,1],[5,2]]\n[[6,0],[5,0],[4,0],[3,2],[2,2],[1,4]]",
|
||||
@@ -31,6 +31,18 @@
|
||||
"translatedName": null,
|
||||
"__typename": "TopicTagNode"
|
||||
},
|
||||
{
|
||||
"name": "Binary Indexed Tree",
|
||||
"slug": "binary-indexed-tree",
|
||||
"translatedName": null,
|
||||
"__typename": "TopicTagNode"
|
||||
},
|
||||
{
|
||||
"name": "Segment Tree",
|
||||
"slug": "segment-tree",
|
||||
"translatedName": null,
|
||||
"__typename": "TopicTagNode"
|
||||
},
|
||||
{
|
||||
"name": "Sorting",
|
||||
"slug": "sorting",
|
||||
@@ -149,7 +161,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"219.4K\", \"totalSubmission\": \"313.5K\", \"totalAcceptedRaw\": 219431, \"totalSubmissionRaw\": 313474, \"acRate\": \"70.0%\"}",
|
||||
"stats": "{\"totalAccepted\": \"221.4K\", \"totalSubmission\": \"315.8K\", \"totalAcceptedRaw\": 221388, \"totalSubmissionRaw\": 315752, \"acRate\": \"70.1%\"}",
|
||||
"hints": [
|
||||
"What can you say about the position of the shortest person? </br>\r\nIf the position of the shortest person is <i>i</i>, how many people would be in front of the shortest person?",
|
||||
"Once you fix the position of the shortest person, what can you say about the position of the second shortest person?"
|
||||
|
Reference in New Issue
Block a user