929. Unique Email Addresses*
https://leetcode.com/problems/unique-email-addresses/
题目描述
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. - All local and domain names are non-empty.
- Local names do not start with a
'+'
character.
C++ 实现 1
哈希表. 这道题需要注意额外的操作(比如遇到 .
或者 +
)都是在 local name 中进行的, 因此代码中使用 is_local_name
判断当前是否在 local name 中.
class Solution {
public:
int numUniqueEmails(vector<string>& emails) {
unordered_set<string> record;
for (auto &email : emails) {
string valid_email;
int i = 0;
bool is_local_name = true;
while (i < email.size()) {
if (email[i] == '@') is_local_name = false;
if (email[i] == '.' && is_local_name) {
++ i;
} else if (email[i] == '+' && is_local_name) {
while (i < email.size() && email[i] != '@') ++ i;
} else {
valid_email += email[i++];
}
}
record.insert(valid_email);
}
return record.size();
}
};
珍妮的选择
发布了231 篇原创文章 · 获赞 6 · 访问量 1万+
私信
关注