Leetcode-929. Unique Email Addresses

—Easy

https://leetcode.com/problems/unique-email-addresses/

Code：

 

class Solution:
    def numUniqueEmails(self, emails) -> int:
        new_em = []
        for elt in emails:
            idx = 0
            for ch in elt:
                if ch == '@':
                    break
                if ch == '.':
                    elt = elt[0:idx]+elt[idx+1:]
                    continue
                if ch == '+':
                    idx_at = 0
                    for ch_at in elt:
                        if ch_at != '@':
                            idx_at += 1
                        else:
                            break
                    elt = elt[0:idx]+elt[idx_at:]
                    break
                idx += 1
            new_em.append(elt)
        ans_list = []
        for elt in new_em:
            if elt not in ans_list:
                ans_list.append(elt)
        return len(ans_list)

#s = Solution()
#e = s.numUniqueEmails(["test.email+alex@leetcode.com","test.e.mail+bob.cathy@leetcode.com","testemail+david@lee.tcode.com"])
#print(["test.email+alex@leetcode.com","test.e.mail+bob.cathy@leetcode.com","testemail+david@lee.tcode.com"])
#print(e)

思路：

1.遍历就完事了，复杂度也没啥好说的，嵌套循环时多加小心

2.感觉会有不寻秩访问的方法，一会查一下