标签：ati substring cte turn boolean find out length not
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.
时间：O(n^2)、空间：O(1)
public class Solution {
public int lengthOfLongestSubstring(String s) {
int first = 0, stepMax = 1, max = s.length() > 0 ? 1 : 0;
for(int i = 1; i < s.length(); i++) {
boolean stop = false;
for(int j = first; j < i; j++) {
if(s.charAt(j) == s.charAt(i)) {
first = j + 1;
stop = true;
break;
}
}
stepMax = stop ? (i - first + 1) : (stepMax + 1);
max = stepMax > max ? stepMax : max;
}
return max;
}
}
3. Longest Substring Without Repeating Characters
标签：ati substring cte turn boolean find out length not
原文地址：http://www.cnblogs.com/YaungOu/p/6718762.html
