LeetCode187 Repeated DNA Sequences

最新推荐文章于 2022-07-28 15:01:27 发布

原创最新推荐文章于 2022-07-28 15:01:27 发布 · 116 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

503 篇文章

订阅专栏

本文介绍了一种算法，用于从DNA分子中找出所有长度为10的重复序列。通过使用字符串和集合操作，该方法能够有效地识别出DNA序列中的重复片段。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

All DNA is composed of a series of nucleotides abbreviated as A, C, G, and T, for example: "ACGAATTCCG". When studying DNA, it is sometimes useful to identify repeated sequences within the DNA.

Write a function to find all the 10-letter-long sequences (substrings) that occur more than once in a DNA molecule.

Example:

Input: s = "AAAAACCCCCAAAAACCCCCCAAAAAGGGTTT"

Output: ["AAAAACCCCC", "CCCCCAAAAA"]

题源：here；完整实现：here

思路：

具体思路请参考：here，这个博主真的写的不错，值得学习。

class Solution {
public:
	vector<string> findRepeatedDnaSequences(string s) {
		set<string> res, duplicate;
		for (int i = 0; i + 9 < int(s.size()); i++) {
			string tmp(s.begin() + i, s.begin() + i + 10);
			if (duplicate.count(tmp)) res.insert(tmp);
			else duplicate.insert(tmp);
		}
		return vector<string>(res.begin(), res.end());
	}
};