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

update

Browse Source
This commit is contained in:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/rank-transform-of-an-array.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 867,
"dislikes": 55,
"likes": 898,
"dislikes": 57,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Rank Transform of a Matrix\", \"titleSlug\": \"rank-transform-of-a-matrix\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Find Target Indices After Sorting Array\", \"titleSlug\": \"find-target-indices-after-sorting-array\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
"exampleTestcases": "[40,10,20,30]\n[100,100,100]\n[37,12,28,9,100,56,80,5,12]",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"56.3K\", \"totalSubmission\": \"96.2K\", \"totalAcceptedRaw\": 56329, \"totalSubmissionRaw\": 96166, \"acRate\": \"58.6%\"}",
"stats": "{\"totalAccepted\": \"58.1K\", \"totalSubmission\": \"99.2K\", \"totalAcceptedRaw\": 58079, \"totalSubmissionRaw\": 99216, \"acRate\": \"58.5%\"}",
"hints": [
"Use a temporary array to copy the array and sort it.",
"The rank of each element is the number of elements smaller than it in the sorted array plus one."