Repeated DNA Sequences问题及解法

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

我们要爱学习

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

阅读量236

点赞数

分类专栏： LeetCode算法练习（Medium）文章标签： LeetCode Medium

本文链接：https://blog.csdn.net/u011809767/article/details/77319946

版权

LeetCode算法练习（Medium）专栏收录该内容

238 篇文章 1 订阅

订阅专栏

问题描述：

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.

示例：

Given s = "AAAAACCCCCAAAAACCCCCCAAAAAGGGTTT",

Return:
["AAAAACCCCC", "CCCCCAAAAA"].

问题分析：

每次取长度为10的子串，判断是否出现过或者出现次数2次及以上，两次以上的保留到结果集上。

过程详见代码：

class Solution {
public:
    vector<string> findRepeatedDnaSequences(string s) {
        vector<string> res;
		unordered_map <string, int> m;
		for (int i = 0; i + 9 < s.length();i++)
		{
			string str = s.substr(i, 10);
			if (!m.count(str)) m[str] = 1;
			else m[str]++;
		}
		for (auto ms : m)
		{
			if (ms.second > 1) res.emplace_back(ms.first);
		}
		return res;
    }
};