1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21:40 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
This commit is contained in:
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions

View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 490,
"dislikes": 883,
"likes": 491,
"dislikes": 884,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[\"cbd\"]\n[\"zaaaz\"]\n[\"bbb\",\"cc\"]\n[\"a\",\"aa\",\"aaa\",\"aaaa\"]",
@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"64.5K\", \"totalSubmission\": \"105.7K\", \"totalAcceptedRaw\": 64546, \"totalSubmissionRaw\": 105698, \"acRate\": \"61.1%\"}",
"stats": "{\"totalAccepted\": \"64.6K\", \"totalSubmission\": \"105.8K\", \"totalAcceptedRaw\": 64578, \"totalSubmissionRaw\": 105774, \"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\"."