coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 07:51: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/minimum-number-of-steps-to-make-two-strings-anagram.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 1976,
"likes": 1977,
"dislikes": 80,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Determine if Two Strings Are Close\", \"titleSlug\": \"determine-if-two-strings-are-close\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Minimum Number of Steps to Make Two Strings Anagram II\", \"titleSlug\": \"minimum-number-of-steps-to-make-two-strings-anagram-ii\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"144.2K\", \"totalSubmission\": \"184.3K\", \"totalAcceptedRaw\": 144186, \"totalSubmissionRaw\": 184318, \"acRate\": \"78.2%\"}",
"stats": "{\"totalAccepted\": \"144.2K\", \"totalSubmission\": \"184.4K\", \"totalAcceptedRaw\": 144221, \"totalSubmissionRaw\": 184357, \"acRate\": \"78.2%\"}",
"hints": [
"Count the frequency of characters of each string.",
"Loop over all characters if the frequency of a character in t is less than the frequency of the same character in s then add the difference between the frequencies to the answer."