public int longestSubString2(String str)
{
char[] strArray = str.ToArray();
int n = strArray.Length;
List<char> list = new List<char>();
int maxString = 0 , i = 0 , j = 0;
while (i < n && j < n)
{
if (!list.Contains(strArray[j]))
{
list.Add(strArray[j++]);
maxString = Math.Max(maxString, j - i);
}
else
{
list.Remove(strArray[i++]);
}
}
return maxString;
}
public class Solution
{
public int longestSubString(String str)
{
int startIdx = 0;//开始索引
int endIdx = 0; //结束索引
int longest = 0;//最大长度
//当前字符串长度
public int longestSubString2(String str) { char[] strArray = str.ToArray(); int n = strArray.Length; List<char> list = new List<char>(); ...