Unique Email Addresses

Every email consists of a local name and a domain name, separated by the @ sign.

For example, in alice@leetcode.comalice is the local name, and leetcode.com is the domain name.

Besides lowercase letters, these emails may contain '.'s or '+'s.

If you add periods ('.') between some characters in the local name part of an email address, mail sent there will be forwarded to the same address without dots in the local name.  For example, "alice.z@leetcode.com" and "alicez@leetcode.com" forward to the same email address.  (Note that this rule does not apply for domain names.)

If you add a plus ('+') in the local name, everything after the first plus sign will be ignored. This allows certain emails to be filtered, for example m.y+name@email.com will be forwarded to my@email.com.  (Again, this rule does not apply for domain names.)

It is possible to use both of these rules at the same time.

Given a list of emails, we send one email to each address in the list.  How many different addresses actually receive mails? 

 

Example 1:

Input: ["test.email+alex@leetcode.com","test.e.mail+bob.cathy@leetcode.com","testemail+david@lee.tcode.com"]
Output: 2
Explanation: "testemail@leetcode.com" and "testemail@lee.tcode.com" actually receive mails

 

Note:

  • 1 <= emails[i].length <= 100
  • 1 <= emails.length <= 100
  • Each emails[i] contains exactly one '@' character.

 

题目理解:

不同的电子邮件地址的写法可能表示同一个电子邮箱,主要有以下两条规则:

“点”规则:在邮件地址“@”符号之前的部分可以随意添加".",在最终确定地址时,将这些"."删除

“加”规则:在邮件地址“@”符号之前的部分可以随意添加"+",在最终确定地址时,"+"后面的部分被删除

问给定的邮箱地址序列中有多少个不同的邮箱

解题思路:

首先提取出@前面的部分local,如果local中有+,那么删除第一个+后面全部的内容;如果local中有.,那么删除所有的.

然后将local重新与@后面的部分domain结合起来,存储集合Set容器,Set会自动去重,最后返回Set的大小就是不同邮箱的数目

class Solution {
    public int numUniqueEmails(String[] emails) {
        Set<String> set = new HashSet<String>();
        for(String str : emails){
            int pos = str.indexOf('@');
            String domain = str.substring(pos + 1);
            str = str.substring(0, pos);
            pos = str.indexOf('+');
            if(pos != -1)
                str = str.substring(0, pos);
            pos = str.indexOf('.');
            while(pos != -1){
                str = str.substring(0, pos) + str.substring(pos + 1);
                pos = str.indexOf('.');
            }
            str += domain;
            set.add(str);
        }
        return set.size();
    }
}

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值