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

update

Browse Source
This commit is contained in:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/compare-strings-by-frequency-of-the-smallest-character.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 491,
"dislikes": 884,
"likes": 495,
"dislikes": 891,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[\"cbd\"]\n[\"zaaaz\"]\n[\"bbb\",\"cc\"]\n[\"a\",\"aa\",\"aaa\",\"aaaa\"]",
@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"64.6K\", \"totalSubmission\": \"105.8K\", \"totalAcceptedRaw\": 64578, \"totalSubmissionRaw\": 105774, \"acRate\": \"61.1%\"}",
"stats": "{\"totalAccepted\": \"65K\", \"totalSubmission\": \"106.5K\", \"totalAcceptedRaw\": 65045, \"totalSubmissionRaw\": 106472, \"acRate\": \"61.1%\"}",
"hints": [
"For each string from words calculate the leading count and store it in an array, then sort the integer array.",
"For each string from queries calculate the leading count \"p\" and in base of the sorted array calculated on the step 1 do a binary search to count the number of items greater than \"p\"."