929. Unique Email Addresses

929. Unique Email Addresses
Easy
<button class="btn&#95;&#95;r7r7 css&#45;1rdgofi">227</button> <button class="btn&#95;&#95;r7r7 css&#45;1rdgofi">66</button> <button class="btn&#95;&#95;r7r7 css&#45;1rdgofi">Favorite</button> <button class="btn&#95;&#95;r7r7 css&#45;1rdgofi">Share</button>

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.
Accepted
46,564
Submissions
58,349

 

class Solution {
public:

         int numUniqueEmails(vector<string>& emails) {
            map<string,int> m1;
            int point,add,at;
            for(auto &astr:emails){
                at=findc(astr,'@',0,astr.length()-1);
                if(at!=-1){
                    while( (add=findc(astr,'+',0,at)) !=-1){
                        astr.erase(add,at-add);
                        at-=(at-add);
                    }
                }
                while( (point=findc(astr,'.',0,at)) != -1){
                    astr.erase(point,1);
                    at-=1;
                }
                m1[astr]++;
            }
            return m1.size();
        }
        int findc(string str,char c,int start,int end){
            for(int i=start;i<=end;i++){
                if(str[i]==c) return i;
            }
            return -1;
        }


};

 

全部评论

相关推荐

程序员牛肉:你这简历有啥值得拷打的?在牛客你这种简历一抓一大把,也就是个人信息不一样而已。 关键要去找亮点,亮点啊,整个简历都跟流水线生产出来的一样。
点赞 评论 收藏
分享
评论
点赞
收藏
分享

创作者周榜

更多
牛客网
牛客网在线编程
牛客网题解
牛客企业服务