3. Longest Substring Without Repeating Characters

Longest Substring Without Repeating Characters

Given a string, find the length of the longest substring without repeating characters.

Example 1:

Input: "abcabcbb"
Output: 3 
Explanation: The answer is "abc", with the length of 3. 

Example 2:

Input: "bbbbb"
Output: 1
Explanation: The answer is "b", with the length of 1.

Example 3:

Input: "pwwkew"
Output: 3
Explanation: 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.

solution

class Solution {
   public int lengthOfLongestSubstring(String s) {
        int maxLen = 0;
        HashMap<Character,Integer> map = new HashMap<>();
        for(int j = 0; j < s.length(); j++){
            int len = 0;
            int i = j;
            while(i < s.length() && !map.containsKey(s.charAt(i))){
                ++len;
                map.put(s.charAt(i),1);
                ++i;
            }
            map.clear();
            if(len > maxLen)
                maxLen = len;
        }
        return maxLen;
    }
}