[LeetCode]find all anagrams in a string (고민중)

문제링크
나의 풀이 : 풀긴 풀었는데... Time Complexity 어쩔...
- 뭔가 ord를 잘 써야할 것 같은데... : ord는 ascii값을 return해주는 내장 함수
다른 사람 풀이

Sliding window algorithm 공부해볼 것

class Solution(object):
def findAnagrams(self, s, p):
    """
    :type s: str
    :type p: str
    :rtype: List[int]
    """
    anaDict = {}
    for i in p :
        if i not in anaDict : 
            anaDict[i] = 1
        else :
            anaDict[i] += 1

    analen = len(p)
    result = []
    for i, v in enumerate(s) :
        checkstr = s[i:i+analen]
        isana = True
        checkDict = anaDict.copy()
        checklen = analen

        for n in checkstr :
            if n not in anaDict : 
                isana = False
                break
            elif checkDict[n] > 0 :
                checkDict[n] = checkDict[n] - 1
                checklen = checklen - 1

        if isana and checklen == 0 :
            result.append(i)

    return result

yeonghwanjeon / coding_practice

[LeetCode]find all anagrams in a string (고민중) #10

Value Assign과 Value change의 차이

Sliding window algorithm