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

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/[no content]count-the-number-of-k-big-indices.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Hard",
"likes": 74,
"likes": 75,
"dislikes": 11,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Count of Smaller Numbers After Self\", \"titleSlug\": \"count-of-smaller-numbers-after-self\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Find All Good Indices\", \"titleSlug\": \"find-all-good-indices\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -64,7 +64,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"3.6K\", \"totalSubmission\": \"6.5K\", \"totalAcceptedRaw\": 3589, \"totalSubmissionRaw\": 6541, \"acRate\": \"54.9%\"}",
"stats": "{\"totalAccepted\": \"3.6K\", \"totalSubmission\": \"6.6K\", \"totalAcceptedRaw\": 3606, \"totalSubmissionRaw\": 6568, \"acRate\": \"54.9%\"}",
"hints": [
"The intended solution uses Fenwick Tree.",
"Let’s describe the solution for counting the number of elements smaller than nums[i] in the range [0, i - 1], and counting in the range [i + 1, nums.length - 1] can be done similarly by simply reversing the array.",