有效的字母异位词

有效的字母异位词

def isAnagram(s: str, t: str) -> bool:
    counter1 = Counter()
    counter2 = Counter()
    for i in s:
        counter1[i] += 1
    for i in t:
        counter2[i] += 1
    if counter1 == counter2:
        return True
    else:
        return False
s = "rat"
t = "car"
print(isAnagram(s,t))

或者：

def isAnagram(s: str, t: str) -> bool:
    return sorted(s) == sorted(t)

s = "anagram"
t = "nagaram"
print(isAnagram(s,t))

或者：

def isAnagram(s: str, t: str) -> bool:
    record = [0] * 26
    for i in s:
        record[ord(i) - ord("a")] += 1
    for i in t:
        record[ord(i) - ord("a")] -= 1
    for i in range(26):
        if record[i] != 0:
            return False
    return True

s = "anagram"
t = "nagaram"
print(isAnagram(s,t))

Counter()，record[ord(i) - ord("a")] += 1

赎金信

def canConstruct(ransomNote: str, magazine: str) -> bool:
    lis = [0] * 26
    for i in magazine:
        lis[ord(i) - ord('a')] += 1
    for i in ransomNote:
        lis[ord(i) - ord('a')] -= 1
        if lis[ord(i) - ord('a')] < 0:
            return False
    return True

下面这个时间快点:

from collections import Counter
def canConstruct(ransomNote: str, magazine: str) -> bool:
    cnt = Counter(magazine)
    for c in ransomNote:
        cnt[c] -= 1
        if cnt[c] < 0:
            return False
    return True

ransomNote = "aa"
magazine = "ab"
print(canConstruct(ransomNote,magazine))

字母异位词分组

这个解法好，我喜欢

from collections import *
def groupAnagrams(strs: list[str]) -> list[list[str]]:
    map=defaultdict(list) # 创建一个空字典
    for i in range(len(strs)):
        key="".join(sorted(strs[i]))
        map[key].append(strs[i])
        # print(list(map.items()))
    return  list(map.values())

strs = ["eat", "tea", "tan", "ate", "nat", "bat"]
print(groupAnagrams(strs))

defaultdict()

找到字符串中所有字母异位词

暴力（超时中…）

def findAnagrams(s: str, p: str) -> list[int]:
    res = []
    for i in range(len(s) - len(p) + 1):
        if s[i] not in p:
            continue
        tmp1 = sorted(s[i:i + len(p)])
        tmp2 = sorted(p)
        if tmp2 == tmp1:
            res.append(i)
    return res

s = "abab"
p = "ab"
print(findAnagrams(s,p))

别人的解法：

def findAnagrams(s: str, p: str) -> list[int]:
    n, m, res = len(s), len(p), []
    if n < m: return res
    p_cnt = [0] * 26
    s_cnt = [0] * 26
    for i in range(m):
        p_cnt[ord(p[i]) - ord('a')] += 1
        s_cnt[ord(s[i]) - ord('a')] += 1
    if s_cnt == p_cnt:
        res.append(0)

    for i in range(m, n):
        s_cnt[ord(s[i - m]) - ord('a')] -= 1
        s_cnt[ord(s[i]) - ord('a')] += 1
        if s_cnt == p_cnt:
            res.append(i - m + 1)
    return res
s = "cbaebabacd"
p = "abc"
print(findAnagrams(s,p))

暴力解法应该是排序那里也费时，我觉得是这样
p_cnt[ord(p[i]) - ord('a')] += 1