567. 字符串的排列【collections】【hash map】【滑動窗口】

第一種：滑動窗口 For each window representing a substring of s2 of length len(s1), we want to check if the count of the window is equal to the count of s1. Here, the count of a string is the list of: [the num

>>阅读原文<<