mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 15:31:43 +08:00
update
This commit is contained in:
@@ -12,7 +12,7 @@
|
||||
"translatedContent": "<p><strong>DNA序列</strong> 由一系列核苷酸组成,缩写为<meta charset=\"UTF-8\" /> <code>'A'</code>, <code>'C'</code>, <code>'G'</code> 和<meta charset=\"UTF-8\" /> <code>'T'</code>.。</p>\n\n<ul>\n\t<li>例如,<meta charset=\"UTF-8\" /><code>\"ACGAATTCCG\"</code> 是一个 <strong>DNA序列</strong> 。</li>\n</ul>\n\n<p>在研究 <strong>DNA</strong> 时,识别 DNA 中的重复序列非常有用。</p>\n\n<p>给定一个表示 <strong>DNA序列</strong> 的字符串 <code>s</code> ,返回所有在 DNA 分子中出现不止一次的 <strong>长度为 <code>10</code></strong> 的序列(子字符串)。你可以按 <strong>任意顺序</strong> 返回答案。</p>\n\n<p> </p>\n\n<p><strong>示例 1:</strong></p>\n\n<pre>\n<strong>输入:</strong>s = \"AAAAACCCCCAAAAACCCCCCAAAAAGGGTTT\"\n<strong>输出:</strong>[\"AAAAACCCCC\",\"CCCCCAAAAA\"]\n</pre>\n\n<p><strong>示例 2:</strong></p>\n\n<pre>\n<strong>输入:</strong>s = \"AAAAAAAAAAAAA\"\n<strong>输出:</strong>[\"AAAAAAAAAA\"]\n</pre>\n\n<p> </p>\n\n<p><strong>提示:</strong></p>\n\n<ul>\n\t<li><code>0 <= s.length <= 10<sup>5</sup></code></li>\n\t<li><code>s[i]</code><code>==</code><code>'A'</code>、<code>'C'</code>、<code>'G'</code> or <code>'T'</code></li>\n</ul>\n",
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Medium",
|
||||
"likes": 355,
|
||||
"likes": 362,
|
||||
"dislikes": 0,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
@@ -167,7 +167,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"92.6K\", \"totalSubmission\": \"176.1K\", \"totalAcceptedRaw\": 92615, \"totalSubmissionRaw\": 176058, \"acRate\": \"52.6%\"}",
|
||||
"stats": "{\"totalAccepted\": \"97K\", \"totalSubmission\": \"184.2K\", \"totalAcceptedRaw\": 97014, \"totalSubmissionRaw\": 184196, \"acRate\": \"52.7%\"}",
|
||||
"hints": [],
|
||||
"solution": null,
|
||||
"status": null,
|
||||
|
Reference in New Issue
Block a user