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

Subscribe to see which companies asked this question

My sOLUTION:

import java.util.*;
public class Solution {
    public List<String> findRepeatedDnaSequences(String s) {
        List<String> re=new ArrayList<String>();
        Set<String> data=new HashSet<String>();
        if(s.length()<=10)
            return re;
        for(int i=0;i+10<=s.length();++i){
            String temp=s.substring(i,i+10);
            if(data.contains(temp)&&!re.contains(temp)){
                re.add(temp);
                continue;
            }
            else{
                data.add(temp);
                continue;
            }
        }
        return re;
    }
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值