LeetCode-Unique Email Addresses

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

For example, in alice@leetcode.com, alice 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.

题意:计算给定列表中不同邮件地址的数量;其中,每个邮件的本地名和域名中可能包含符号‘.’和‘+’,对于本地名有如下规则:

  • 如果包含符号‘.’,则连接符合‘.’后的连续字母
  • 如果包含符号‘+’,则对于此字符之后的所有字符都不连接

解法:要计算有多少个不同的邮件地址,我们可以用一个集合来存储,这样最后返回集合的长度就是不同邮件地址的个数了;因此,最重要的一个步骤就是根据上面的规则得出邮件地址,我们只需要处理的是本地名即可;

Java
class Solution {
    public int numUniqueEmails(String[] emails) {
        Set<String> table = new HashSet<>();
        for (String email : emails) {
            table.add(getEmail(email));
        }
        return table.size();
    }
    
    private String getEmail(String email) {
        StringBuilder sb = new StringBuilder();
        int index = email.indexOf('@');
        for (int i = 0; i < index; i++) {
            if (email.charAt(i) == '.') continue;
            if (email.charAt(i) == '+') break;
            sb.append(email.charAt(i));
        }
        sb.append(email.substring(index));
        return sb.toString();
    }
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值