public class Solution {
public List
findRepeatedDnaSequences(String s) {
List
ans = new ArrayList
();
HashSet
set = new HashSet
(); for(int i=0; i<=s.length()-10; i++){ String substr = s.substring(i,i+10); if(!set.contains(substr)){ set.add(substr); }else if(set.contains(substr) && !ans.contains(substr)){ ans.add(substr); } } return ans; } public int hashStr(String s){ int res = 0; for(int i=0;i
<< 2 | hashChar(c); } return res; } public int hashChar(char c){ switch(c){ case 'A': return 0; case 'C': return 1; case 'G': return 2; case 'T': return 3; default: return 0; } } }
[LeetCode]Repeated DNA Sequence
最新推荐文章于 2023-02-25 23:03:36 发布