coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 15:01:40 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/k-highest-ranked-items-within-a-price-range.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 234,
"dislikes": 103,
"likes": 235,
"dislikes": 105,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Kth Largest Element in an Array\", \"titleSlug\": \"kth-largest-element-in-an-array\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"As Far from Land as Possible\", \"titleSlug\": \"as-far-from-land-as-possible\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "[[1,2,0,1],[1,3,0,1],[0,2,5,1]]\n[2,5]\n[0,0]\n3\n[[1,2,0,1],[1,3,3,1],[0,2,5,1]]\n[2,3]\n[2,3]\n2\n[[1,1,1],[0,0,1],[2,3,4]]\n[2,3]\n[0,0]\n3",
@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"7.9K\", \"totalSubmission\": \"19.8K\", \"totalAcceptedRaw\": 7885, \"totalSubmissionRaw\": 19782, \"acRate\": \"39.9%\"}",
"stats": "{\"totalAccepted\": \"7.9K\", \"totalSubmission\": \"19.8K\", \"totalAcceptedRaw\": 7903, \"totalSubmissionRaw\": 19833, \"acRate\": \"39.8%\"}",
"hints": [
"Could you determine the rank of every item efficiently?",
"We can perform a breadth-first search from the starting position and know the length of the shortest path from start to every item.",