187. 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.

For example,

Given s = "AAAAACCCCCAAAAACCCCCCAAAAAGGGTTT",

Return:

["AAAAACCCCC", "CCCCCAAAAA"].

理解需要看这篇文章……

http://www.cnblogs.com/grandyang/p/4284205.html

class Solution {
public:
    vector<string> findRepeatedDnaSequences(string s) {
        
        unordered_set<string> res;//发现加不加unordered_速度差了好多啊……
        unordered_set<int> st;
        unordered_map<int, int> m{{'A', 0}, {'C', 1}, {'G', 2}, {'T', 3}};
        int cur=0, i=0;
        while(i<9){
            cur=cur<<2|m[s[i++]];
        }
        while(i<s.size()){
            cur=(cur&0X3ffff)<<2|m[s[i++]];//不是很懂为什么一定要用mask。。。直接移位不行吗。。。。
            if(st.count(cur)) res.insert(s.substr(i-10, 10));
            else st.insert(cur);
        }
        
        return vector<string>(res.begin(), res.end());
        
    }
};