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"].
求长度为10的重复子串重复出现2次及以上的DNS序列,采用滑窗方式求解,程序如下所示:

class Solution {
    public List<String> findRepeatedDnaSequences(String s) {
        List<String> list = new ArrayList<>();
        int len = s.length();
        if (len < 10){
            return list;
        }
        String str = s.substring(0, 10);
        Map<String, Integer> map = new HashMap<>();
        map.put(str, 1);
        for (int i = 1; i < len; ++ i){
            if (i + 10 > len){
                break;
            }
            str = s.substring(i, i + 10);
            if (map.containsKey(str)){
                int index = map.get(str);
                if (index == 1){
                    list.add(str);
                }
                map.put(str, index + 1);
            }
            else {
                map.put(str, 1);
            }
        }
        return list;
    }
}





  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值