leetcode_c++：哈希： Repeated DNA Sequences(187)

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”].

---

算法

o（n)

---

//
//  main.cpp
//  CplusplusTest
//
//  Created by mijian on 16/7/1.
//  Copyright © 2016年 mijian. All rights reserved.
//

#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <limits.h>
#include <unordered_map>
#include <sstream>

using  namespace std;
const int MAX_LEN=10;


class Solution {
public:
    int ACGT2Int(char ch){
        switch(ch){
            case 'A':return 0;
            case 'C':return 1;
            case 'G':return 2;
            case 'T':return 3;
        }
        return -1;

    }

    int DNASeq2Int(string &s,int begin){
        int result=0;
        for(int i=0;i<MAX_LEN; i++){
            result = result*4+ACGT2Int(s[i+begin]);
        }

        return result;
    }
    vector<string> findRepeatedDnaSequences(string s) {
        unordered_map<int ,int> stat;

        vector<string> result;
        for(int i=0;i+MAX_LEN<=s.size();i++){
            int hash_code=DNASeq2Int(s,i);
            stat[hash_code]++;
            if(stat[hash_code]==2){
                result.push_back(s.substr(i,MAX_LEN));
            }
        }

        return result;


    }


    void printvector(vector<string> v){
        cout<<"[ ";
        for(int i=0;i<v.size();i++){
            cout<<v[i]<<(i<v.size()-1 ? ",":" ");
        }
        cout<<"] ";
    }
};


int main(int argc,char** agrv){
    string s="GAGAGAGAGAGAGA";
    Solution res;
    res.printvector(res.findRepeatedDnaSequences(s));
    return 0;
}