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 {
	//对长度为10的String s进行编码，不同的s对应唯一不同的整数sum
	public int encode(String s) {
		int sum = 0;
		for (int i = 0; i < s.length(); i++) {
			if (s.charAt(i) == 'A') {
				sum = sum * 4;
			} else if (s.charAt(i) == 'C') {
				sum = sum * 4 + 1;
			} else if (s.charAt(i) == 'G') {
				sum = sum * 4 + 2;
			} else {
				sum = sum * 4 + 3;
			}
		}
		return sum;
	}
	public List<String> findRepeatedDnaSequences(String s) {
		HashSet<Integer> hash = new HashSet<Integer>();
		HashSet<String> dna = new HashSet<String>();
		for (int i = 9; i < s.length(); i++) {
			String subString = s.substring(i - 9, i + 1);
			int encoded = encode(subString);
			if (hash.contains(encoded)) {
				dna.add(subString);
			} else {
				hash.add(encoded);
			}
		}
		List<String> result = new ArrayList<String>();
		for (String d : dna) {
			result.add(d);
		}
		return result;
	}
	public static void main(String[] args) {
		Solution solution = new Solution();
		List res = solution.findRepeatedDnaSequences("AAAAACCCCCAAAAACCCCCCAAAAAGGGTTT");
		System.out.println(res);
	}
}