coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 15:31:43 +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/count-k-subsequences-of-a-string-with-maximum-beauty.json
View File

@@ -167,7 +167,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"9.5K\", \"totalSubmission\": \"33.8K\", \"totalAcceptedRaw\": 9488, \"totalSubmissionRaw\": 33784, \"acRate\": \"28.1%\"}",
"stats": "{\"totalAccepted\": \"9.5K\", \"totalSubmission\": \"33.8K\", \"totalAcceptedRaw\": 9490, \"totalSubmissionRaw\": 33795, \"acRate\": \"28.1%\"}",
"hints": [
"Since every character appears once in a k-subsequence, we can solve the following problem first: Find the total number of ways to select <code>k</code> characters such that the sum of their frequencies is maximum.",
"An obvious case to eliminate is if <code>k</code> is greater than the number of distinct characters in <code>s</code>, then the answer is <code>0</code>.",