mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-10-21 21:16:45 +08:00
update
This commit is contained in:
@@ -12,7 +12,7 @@
|
||||
"translatedContent": "<p>给你一个字符串 <code>s</code> 和一个整数 <code>k</code> ,请你找出 <code>s</code> 中的最长子串, 要求该子串中的每一字符出现次数都不少于 <code>k</code> 。返回这一子串的长度。</p>\n\n<p> </p>\n\n<p><strong>示例 1:</strong></p>\n\n<pre>\n<strong>输入:</strong>s = \"aaabb\", k = 3\n<strong>输出:</strong>3\n<strong>解释:</strong>最长子串为 \"aaa\" ,其中 'a' 重复了 3 次。\n</pre>\n\n<p><strong>示例 2:</strong></p>\n\n<pre>\n<strong>输入:</strong>s = \"ababbc\", k = 2\n<strong>输出:</strong>5\n<strong>解释:</strong>最长子串为 \"ababb\" ,其中 'a' 重复了 2 次, 'b' 重复了 3 次。</pre>\n\n<p> </p>\n\n<p><strong>提示:</strong></p>\n\n<ul>\n\t<li><code>1 <= s.length <= 10<sup>4</sup></code></li>\n\t<li><code>s</code> 仅由小写英文字母组成</li>\n\t<li><code>1 <= k <= 10<sup>5</sup></code></li>\n</ul>\n",
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Medium",
|
||||
"likes": 661,
|
||||
"likes": 675,
|
||||
"dislikes": 0,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
@@ -155,7 +155,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"61.6K\", \"totalSubmission\": \"117.9K\", \"totalAcceptedRaw\": 61641, \"totalSubmissionRaw\": 117903, \"acRate\": \"52.3%\"}",
|
||||
"stats": "{\"totalAccepted\": \"63.5K\", \"totalSubmission\": \"121.3K\", \"totalAcceptedRaw\": 63490, \"totalSubmissionRaw\": 121325, \"acRate\": \"52.3%\"}",
|
||||
"hints": [],
|
||||
"solution": null,
|
||||
"status": null,
|
||||
|
Reference in New Issue
Block a user