Longest Substring Without Repeating Characters

标签：leetcode   java   

Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. For "bbbbb" the longest substring is "b", with the length of 1.

public class Solution {
    public int lengthOfLongestSubstring(String s) {
		if (s == null || s.isEmpty()) {
			return 0;
		}
		
		int pre = 1; 
		int length = s.length();
		int longest = 0;
		if(length == 1) return 1;  
		for (int i = 1; i < length; i++) {
			char temp = s.charAt(i);
			int j = i - 1;
			int count = 1;
			while (j >= 0 && temp != s.charAt(j)) {
				j--;
				count++;
			}
            if(count >= pre+1) count = pre+1;  
            if(count > longest) longest = count;  
            pre = count;  
		}
		return longest;
    }
}

Longest Substring Without Repeating Characters

标签：leetcode   java   

原文地址：http://blog.csdn.net/jason_wang1989/article/details/24700407