187. Repeated DNA Sequences**

187. Repeated DNA Sequences**

https://leetcode.com/problems/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.

Example:

Input: s = "AAAAACCCCCAAAAACCCCCCAAAAAGGGTTT"

Output: ["AAAAACCCCC", "CCCCCAAAAA"]

C++ 实现 1

题目不难, 但需要注意的是, 最后的输出结果要去重, 所以使用 tmp 先保存结果, 再保存到 res 中.

另一个要点是 C++ 本身, for 循环中的判断语句:

for (int i = 0; i + 10 <= s.size() ; ++ i)

我一开始写成:

for (int i = 0; i <= s.size() - 10; ++ i)

如果输入的测试用例为 "", 那么 s.size() - 10 得到的结果是: 18446744073709551606, 显然是有问题的, 原因在于 size_t 为无符号整型.

class Solution {
public:
    vector<string> findRepeatedDnaSequences(string s) {
        unordered_set<string> record, tmp;
        for (int i = 0; i + 10 <= s.size() ; ++ i) {
            auto pattern = s.substr(i, 10);
            if (!record.count(pattern)) record.insert(pattern);
            else tmp.insert(pattern);
        }
        vector<string> res(tmp.begin(), tmp.end());
        return res;
    }
};