Re: [闲聊] 每日leetcode

楼主: DJYOSHITAKA (Evans)   2024-10-05 11:01:34
原本还想说sliding怎么滑==
靠北写完才想到这window size是固定的 最简单的那种滑==
我好烂==
def checkInclusion(self, s1: str, s2: str) -> bool:
cnt_s1 = [0 for _ in range(26)]
for c in s1:
cnt_s1[ord(c)-ord('a')] += 1
cnt_cur = [0 for _ in range(26)]
st = set()
st.add(tuple(cnt_cur))
for c in s2:
cnt_cur[ord(c)-ord('a')] += 1
cnt_sub = [n_cur-n_s1 for n_cur,n_s1 in zip(cnt_cur,cnt_s1)]
if tuple(cnt_sub) in st:
return True
st.add(tuple(cnt_cur))
return False
作者: rainkaras (rainkaras)   2024-10-05 11:19:00
窗滑大师

Links booklink

Contact Us: admin [ a t ] ucptt.com