mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 15:01:40 +08:00
update
This commit is contained in:
@@ -11,8 +11,8 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Medium",
|
||||
"likes": 186,
|
||||
"dislikes": 61,
|
||||
"likes": 258,
|
||||
"dislikes": 66,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Minimum Deletions to Make Character Frequencies Unique\", \"titleSlug\": \"minimum-deletions-to-make-character-frequencies-unique\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Minimum Operations to Make the Array Alternating\", \"titleSlug\": \"minimum-operations-to-make-the-array-alternating\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
|
||||
"exampleTestcases": "[1,1,2,3,5]\n[1,1,2,2,3,3]",
|
||||
@@ -20,8 +20,14 @@
|
||||
"contributors": [],
|
||||
"topicTags": [
|
||||
{
|
||||
"name": "Dynamic Programming",
|
||||
"slug": "dynamic-programming",
|
||||
"name": "Array",
|
||||
"slug": "array",
|
||||
"translatedName": null,
|
||||
"__typename": "TopicTagNode"
|
||||
},
|
||||
{
|
||||
"name": "Stack",
|
||||
"slug": "stack",
|
||||
"translatedName": null,
|
||||
"__typename": "TopicTagNode"
|
||||
},
|
||||
@@ -143,7 +149,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"12.6K\", \"totalSubmission\": \"30K\", \"totalAcceptedRaw\": 12642, \"totalSubmissionRaw\": 30001, \"acRate\": \"42.1%\"}",
|
||||
"stats": "{\"totalAccepted\": \"16.2K\", \"totalSubmission\": \"37.1K\", \"totalAcceptedRaw\": 16200, \"totalSubmissionRaw\": 37108, \"acRate\": \"43.7%\"}",
|
||||
"hints": [
|
||||
"Delete as many adjacent equal elements as necessary.",
|
||||
"If the length of nums is odd after the entire process, delete the last element."
|
||||
|
Reference in New Issue
Block a user