qq_32176879的博客

Given two strings s and t, determine if they are isomorphic. Two strings are isomorphic if the characters in s can be replaced to get t. All occurrences of a character must be replaced with anot

Given a string s and a non-empty string p, find all the start indices of p's anagrams in s. Strings consists of lowercase English letters only and the length of both strings s and p will not be

/* Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n). For example, S = "ADOBECODEBANC" T = "ABC" Minimum window is "BANC". 给

/* Given a string, find the length of the longest substring without repeating characters. 给定一个字符串，找到最长子串的长度，而不重复字符。 */ int lengthOfLongestSubstring(string s) { if (s.size() == 0) return 0;

总的思路是使用了两次滑动窗：第一次是用于截取满足长度要求的混序子字符串，第二次是判断混序子字符串是否满足题意