LeetCode-SP-Data-Structures-/validAnagram.py at main · Elevenv/LeetCode-SP-Data-Structures- · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
# https://leetcode.com/problems/valid-anagram/?envType=study-plan&id=data-structure-i

class Solution:
    def isAnagram(self, s: str, t: str) -> bool:
        # ss = sorted(s)
        # tt = sorted(t)
        # return ss==tt

        # OR

        # if len(s)!=len(t):
        #     return False

        # for i in s:
        #     if i not in t:
        #         return False
        # else:
        #     d = {}
        #     d1 = {}
        #     for j in s:
        #         if j in d:
        #             d[j]+=1
        #         else:
        #             d[j] = 1

        #     for k in t:
        #         if k in d1:
        #             d1[k]+=1
        #         else:
        #             d1[k] = 1
        #     for l in d:
        #         if d[l]!=d1[l]:
        #             return False
        #     return True

# OR

#         l = []

#         for i in t:
#             l.append(i)

#         for j in s:
#             if j not in l:
#                 return False
#             l.remove(j)

#         if l:
#             return False
#         else:
#             return True

# OR


        if len(s)!=len(t):
            return False
        sd ,td = defaultdict(int),defaultdict(int)

        for i in s:
            sd[i]+=1

        for j in t:
            td[j]+=1

        for k in s:
            if sd[k]!=td[k]:
                return False
        else:
            return True

# OR
        # if len(s)!=len(t): return False
        # s = sorted(s)
        # t = sorted(t)
        # for i in range(len(s)):
        #     if s[i]!=t[i]:
        #         return False
        # return True