首页 > 其他 > 详细

LeetCode187——Repeated DNA Sequences

时间:2015-08-19 00:36:02      阅读:205      评论:0      收藏:0      [点我收藏+]

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) {
        vector<string> vs;
        char hash[1048575] = {0};
        if (s.size() < 11) return vs;
        int len = s.size();
        int flag = 0;
        for (int i = 0; i < 9; i++) {
            flag = flag << 2 | (s[i] - ‘A‘ + 1) % 5;
        }
        for (int i = 9; i < s.size(); i++) {
            if (hash[(flag= flag << 2 | (s[i] - ‘A‘ + 1) % 5)&0xfffff]++ == 1) {
                vs.push_back(s.substr(i-9, 10));
            }
        }
        return vs;
    }
};



版权声明:本文为博主原创文章,未经博主允许不得转载。

LeetCode187——Repeated DNA Sequences

原文:http://blog.csdn.net/booirror/article/details/47763553

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!