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

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/lexicographically-smallest-palindrome.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 297,
"likes": 298,
"dislikes": 14,
"isLiked": null,
"similarQuestions": "[]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"36.2K\", \"totalSubmission\": \"45K\", \"totalAcceptedRaw\": 36224, \"totalSubmissionRaw\": 45041, \"acRate\": \"80.4%\"}",
"stats": "{\"totalAccepted\": \"36.3K\", \"totalSubmission\": \"45.1K\", \"totalAcceptedRaw\": 36259, \"totalSubmissionRaw\": 45092, \"acRate\": \"80.4%\"}",
"hints": [
"We can make any string a palindrome, by simply making any character at index i equal to the character at index length - i - 1 (using 0-based indexing).",
"To make it lexicographically smallest we can change the character with maximum ASCII value to the one with minimum ASCII value."