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


public class Solution {
    public List<String> findRepeatedDnaSequences(String s) {
    	List<String> res = new ArrayList<>();
    	HashMap<Integer,Integer> hashMap = new HashMap<>();
    	int sum = 0;
    	for (int i = 0; i < s.length(); i++) {
			sum = ((sum << 3) | (s.charAt(i) & 7)) & 0x3FFFFFFF;  
			if (i < 9) {
				continue;
			}
			Integer integer = hashMap.get(sum);
			if (integer != null && integer == 1) {
				res.add(s.substring(i-9, i+1));
			}
			hashMap.put(sum, integer != null ? integer+1 : 1);
		}
    	return res;
    }
}
 
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值