LeetCode: Repeated DNA Sequences

最新推荐文章于 2024-04-21 19:46:46 发布

原创最新推荐文章于 2024-04-21 19:46:46 发布 · 508 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

186 篇文章

订阅专栏

本文介绍了一种使用哈希映射来查找DNA字符串中长度为10且出现多次的子序列的方法。通过位操作提高效率，避免了直接字符串比较，使得算法能够在O(n)的时间复杂度内完成。

摘要生成于 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.

For example,

Given s = "AAAAACCCCCAAAAACCCCCCAAAAAGGGTTT",

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

class Solution {
public:
    vector<string> findRepeatedDnaSequences(string s) {
        map<int, int> m_map;
        map<char, int> convert;
        int cur = 0;
        convert['A'] = 0;
        convert['C'] = 1;
        convert['G'] = 2;
        convert['T'] = 3;
        vector<string> result;
        if(s.size() < 10)
            return result;
        for(int i = 0; i < s.size(); i++)
        {
            cur = (cur << 2 | convert[s[i]]) & 0xFFFFF;
            if(m_map[cur] == 1 && i >= 9)
                result.push_back(s.substr(i-9, 10));
            if(i >= 9)
                m_map[cur]++;
        }
        return result;
    }
};