本体用了正则和非正则两种方式,结果来说非正则快一点,用set去重都是一样的。这里吐槽一下LeetCode有些通过代码明显是错误的,还是测试用例不完善的锅啊。
问题链接:https://leetcode-cn.com/problems/unique-email-addresses/
代码:(正则)
public int numUniqueEmails(String[] emails) {
Set<String> result = new HashSet<>();
for (String s:emails){
String[] temp = s.split("@");
temp[0]=temp[0].replaceAll(".","");
Pattern p = Pattern.compile("/+");
Matcher m = p.matcher(temp[0]);
StringBuffer sb = new StringBuffer();
if(m.find()){
m.appendReplacement(sb,"");
}
temp[0]=sb.toString();
result.add(temp[0]+"@"+temp[1]);
}
return result.size();
}
代码:(非正则)
public int numUniqueEmails(String[] emails) {
Set<String> s = new HashSet<>();
for(String n:emails){
StringBuffer sb =new StringBuffer();
int index = n.indexOf("@");
for (int i = 0;i<index;i++){
if(n.charAt(i)=='.'){
continue;
}
if (n.charAt(i)=='+') {
break;
}
sb.append(n.charAt(i));
}
sb.append(n.substring(index));
s.add(sb.toString());
}
return s.size();
}