2019年8月21日
424. Longest Repeating Character Replacement - Medium
摘要： Given a string s that consists of only uppercase English letters, you can perform at most k operations on that string. In one operation, you can choos 阅读全文
posted @ 2019-08-21 12:53 fatttcat 阅读(162) 评论(0) 推荐(0)
1100. Find K-Length Substrings With No Repeated Characters - Medium
摘要： Given a string S, return the number of substrings of length K with no repeated characters. Example 1: Example 2: Note: sliding window 1. first store t 阅读全文
posted @ 2019-08-21 09:15 fatttcat 阅读(322) 评论(0) 推荐(0)
567. Permutation in String - Medium
摘要： Given two strings s1 and s2, write a function to return true if s2contains the permutation of s1. In other words, one of the first string's permutatio 阅读全文
posted @ 2019-08-21 08:51 fatttcat 阅读(126) 评论(0) 推荐(0)