标签：ges null character ror method nta lis sts err
Given a string, find the length of the longest substring without repeating characters. Examples: Given "abcabcbb", the answer is "abc", which the length is 3. Given "bbbbb", the answer is "b", with the length of 1. Given "pwwkew", the answer is "wke", with the length of 3.
Note that the answer must be a substring, "pwke" is a subsequence and not a substring.
为什么直接写成list, 不行, 非得写成linkedlist, 或者queue. Queue<Character> list = new LinkedList<>();针对remove()
e.g.
error: no suitable method found for remove(no arguments)
public int lengthOfLongestSubstring(String s) {
if (s == null || s.length() == 0) {
return 0;
}
int ans = 1;
// int temp = 1;
Queue<Character> list = new LinkedList<>();
for (int i = 0; i < s.length(); i++) {
if (!list.contains(s.charAt(i))) {
list.add(s.charAt(i));
ans = Math.max(ans, list.size());
} else {
while (list.contains(s.charAt(i))) {
Character head = list.remove();
}
list.add(s.charAt(i));
}
}
return ans;
}
3. Longest Substring Without Repeating Characters
标签：ges null character ror method nta lis sts err
原文地址：http://www.cnblogs.com/apanda009/p/7549584.html
