mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 06:51:41 +08:00
update
This commit is contained in:
@@ -11,8 +11,8 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Medium",
|
||||
"likes": 9280,
|
||||
"dislikes": 3129,
|
||||
"likes": 9297,
|
||||
"dislikes": 3136,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Permutations\", \"titleSlug\": \"permutations\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Permutations II\", \"titleSlug\": \"permutations-ii\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Permutation Sequence\", \"titleSlug\": \"permutation-sequence\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Palindrome Permutation II\", \"titleSlug\": \"palindrome-permutation-ii\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Minimum Adjacent Swaps to Reach the Kth Smallest Number\", \"titleSlug\": \"minimum-adjacent-swaps-to-reach-the-kth-smallest-number\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
|
||||
"exampleTestcases": "[1,2,3]\n[3,2,1]\n[1,1,5]",
|
||||
@@ -131,7 +131,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"732.9K\", \"totalSubmission\": \"2.1M\", \"totalAcceptedRaw\": 732897, \"totalSubmissionRaw\": 2064884, \"acRate\": \"35.5%\"}",
|
||||
"stats": "{\"totalAccepted\": \"734.4K\", \"totalSubmission\": \"2.1M\", \"totalAcceptedRaw\": 734375, \"totalSubmissionRaw\": 2068397, \"acRate\": \"35.5%\"}",
|
||||
"hints": [],
|
||||
"solution": {
|
||||
"id": "58",
|
||||
|
Reference in New Issue
Block a user