1
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
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

View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 323,
"likes": 326,
"dislikes": 517,
"isLiked": null,
"similarQuestions": "[]",
@@ -131,7 +131,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"36.7K\", \"totalSubmission\": \"44.4K\", \"totalAcceptedRaw\": 36731, \"totalSubmissionRaw\": 44374, \"acRate\": \"82.8%\"}",
"stats": "{\"totalAccepted\": \"37.1K\", \"totalSubmission\": \"44.8K\", \"totalAcceptedRaw\": 37139, \"totalSubmissionRaw\": 44838, \"acRate\": \"82.8%\"}",
"hints": [
"Create the permutation P=[1,2,...,m], it could be a list for example.",
"For each i, find the position of queries[i] with a simple scan over P and then move this to the beginning."