1
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
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": "Hard",
"likes": 449,
"likes": 456,
"dislikes": 61,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Count Good Triplets in an Array\", \"titleSlug\": \"count-good-triplets-in-an-array\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Longest Substring of One Repeating Character\", \"titleSlug\": \"longest-substring-of-one-repeating-character\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"19.5K\", \"totalSubmission\": \"52.5K\", \"totalAcceptedRaw\": 19503, \"totalSubmissionRaw\": 52520, \"acRate\": \"37.1%\"}",
"stats": "{\"totalAccepted\": \"19.7K\", \"totalSubmission\": \"52.9K\", \"totalAcceptedRaw\": 19674, \"totalSubmissionRaw\": 52909, \"acRate\": \"37.2%\"}",
"hints": [
"This problem is closely related to finding the number of inversions in an array",
"if i know the position in which i will insert the i-th element in I can find the minimum cost to insert it"