本文主要是介绍Repeated DNA Sequences问题及解法，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！
问题描述：
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;}
};这篇关于Repeated DNA Sequences问题及解法的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！
