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

2
leetcode/originData/minimum-cost-to-make-all-characters-equal.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"16.4K\", \"totalSubmission\": \"30.7K\", \"totalAcceptedRaw\": 16407, \"totalSubmissionRaw\": 30686, \"acRate\": \"53.5%\"}",
"stats": "{\"totalAccepted\": \"16.4K\", \"totalSubmission\": \"30.7K\", \"totalAcceptedRaw\": 16417, \"totalSubmissionRaw\": 30698, \"acRate\": \"53.5%\"}",
"hints": [
"For every index i, calculate the number of operations required to make the prefix [0, i - 1] equal to the character at index i, denoted prefix[i].",
"For every index i, calculate the number of operations required to make the suffix [i + 1, n - 1] equal to the character at index i, denoted suffix[i].",